专利摘要:
Computer-readable systems, methods, apparatus and media for allocating vehicle resources for future vehicle needs according to priority environments, such as at or near 'hot spots' or other priority positions, where the number of requests for vehicle resources is particularly high or likely to be particularly high. In one embodiment, a vehicle resource allocation system allocates vehicles to requested positions so that vehicles in a fleet can be more readily available to a hotspot without requiring vehicles to be specifically directed. towards the sensitive point.
公开号:FR3033066A1
申请号:FR1651515
申请日:2016-02-24
公开日:2016-08-26
发明作者:Larry Scicluna
申请人:Addison Lee Ltd；
IPC主号:

专利说明:

[0001] Field of the Invention The present invention relates to resource allocation systems at desired positions, using a communications network, and relates in particular to the automatic management of the presence of vehicle resources in regions with priority environments or close to them.
[0002] Prior State of the Invention In the field of the management of a fleet of vehicles (eg delivery trucks, rental vehicles with driver, taxis), in the past a human operator, called a controller, allocated the vehicles and drivers to bookings. The controller communicated with the fleet vehicle drivers on the voice channels (typically only one shared voice channel) of a radio system that allowed the controller and the drivers to converse. The controller determined the locations of the drivers by asking them to verbally indicate their position. The controller could also ask the drivers to indicate when they thought they would drop off their passengers and be available again to fulfill a reservation.
[0003] The details of this reservation were generally communicated verbally by the controller to the drivers via the radio system. Such manual management systems remain widespread. Automated vehicle allocation (eg using a communications network to communicate with remote vehicle resources) poses some challenges, such as managing vehicles so that they can be appropriately positioned to respond to a problem. vehicle request. If the vehicles are properly positioned, the requests can then be satisfied relatively quickly because the travel time of an available vehicle to the desired position is relatively short. However, it may happen that the automatic assignment of the vehicle closest to the desired position does not take into account other factors 3033066 2 that contribute to the overall efficiency of the allocation mode of vehicles and other mobile resources. BRIEF DESCRIPTION OF THE FIGURES Embodiments of the invention will now be described, by way of example only, with reference to the accompanying drawings in which: Figure 1 is a block diagram of a management system of a plurality of vehicle resources according to various aspects of the present invention; Fig. 2 is a block diagram of an exemplary geographical region including a plurality of vehicle resources, serving positions and priority environments, in accordance with various aspects of the present invention; Fig. 3 is a flowchart illustrating an exemplary process of a vehicle resource allocation system according to an extended priority area, in accordance with various aspects of the present invention; Fig. 4 is a flowchart illustrating an exemplary process of a system of managing a plurality of vehicle resources based on proximity to a priority position, in accordance with various aspects of the present invention; Fig. 5 is a flowchart illustrating an exemplary process of a management system of a plurality of vehicle resources according to a priority position, according to various aspects of the present invention; Fig. 6 is a block diagram of an example of a geographical region, comprising a plurality of vehicle resources and a priority environment, managed by a vehicle resource management system, in accordance with various aspects of the present invention; Figure 7 is a flowchart illustrating an exemplary process of a management system of a plurality of vehicle resources, in accordance with various aspects of the present invention; Figure 8a is a block diagram of a rental vehicle rental vehicle management system in accordance with various aspects of the present invention; Figure 8b is a block diagram of a different configuration of the driver-rental vehicle service management system of Figure 8a according to various aspects of the present invention; Fig. 9 is a flowchart illustrating the overall operation of the system of Fig. 8a or the system of Fig. 8b to satisfy a rental car rental reservation; Fig. 10 is a flowchart illustrating the calculation of a score of a vehicle / driver combination with respect to a reservation executed by the system of Fig. 8a or the system of Fig. 8b; Figure 11 is a flowchart illustrating the allocation of a vehicle / driver binomial with respect to a reservation, performed by the system of Figure 8a or the system of Figure 8b; and Figure 12 is a block diagram illustrating the components of a server forming part of the system of Figure 1, Figure 8a, or Figure 8b.
[0004] DETAILED DESCRIPTION OF PARTICULAR EMBODIMENTS OF THE INVENTION In a few words, various embodiments of the present invention make it possible to create and / or identify priority positions (also referred to herein as "hot spots") in a vehicle resource allocation system.
[0005] A sore point is a position or region where the demand for vehicles and / or other types of mobile resources is particularly high or likely to be particularly high (eg relative to other positions). As set forth in the present disclosure, a skew point may be associated with a region outside of but near the sore spot (referred to herein as the 'extended priority area'). The extended priority area may not know the particularly high demand of its associated hotspot. In some embodiments, the extended priority area may be defined by an 'attraction distance' and / or a specific geographic region (eg, surrounding a hotspot). In the present disclosure, a hot spot and its associated extended priority area may be referred to collectively as the 'priority environment'. In accordance with some embodiments, to meet vehicle resource demands, the vehicle resource allocation system assigns vehicles to particular positions (eg destinations or targets requested) such that the vehicles of a fleet may be attracted to a sensing point 5 organically and without the vehicles having to be directed specifically to the sore spot. In addition, this is done automatically. If the vehicles are suitably positioned, according to some embodiments, the requests that require a vehicle as soon as possible can then be satisfied relatively quickly because the travel time from an available vehicle to a requested position (e.g. from a rescue vehicle to a traffic accident, from a taxi to the collection position of a reservation) is relatively short. Advance requests (eg scheduled deliveries, taxi reservations) can also be more efficiently fulfilled. This also helps to minimize the distances traveled by fleet vehicles, reduce fuel costs, improve vehicle usage, reduce wear and reduce driver fatigue. In accordance with some embodiments, the vehicle resource allocation system allocates vehicles at one or more particular positions, such as in response to a received vehicle resource request on a communication network, and / or in response another indication of a need (or potential need) for a vehicle resource at a particular position. Requests for vehicle resources may include any number of particular positions, such as in the case of a vehicle to carry goods and / or people of a first position (eg, a collection position). at a second position (eg a stow position), or to travel a particular road with several specific positions (eg points of interest or patrol waypoints). Various types of vehicle resources may be managed in accordance with various aspects of the present invention. In one example, a police, fire, emergency medical or other first responder system may have to allocate vehicles (eg emergency vehicles, police cars) to 3033066 -5 specific positions, such as the scene of an accident, the location of a crime or victim of a crime, or in another area requiring response services. In another example, a search and rescue operation may have to allocate vehicles and / or mobile personnel to a specific position (eg a specific search position in a larger search grid), as in response to a track, signage, or other relevant information. In another example, a vehicle resource allocation system of a rental vehicle-driver service can allocate vehicles (eg, taxis) to collect and drop off travelers.
[0006] Vehicle resources may include, by way of example and without limitation, land vehicles (eg, cars, trucks, taxis, construction equipment, etc.), watercraft (eg, boats, ships, etc.), aircraft (eg aircraft, helicopters, aerial drones, etc.), and / spacecraft. Although some examples of vehicles disclosed herein are described as having drivers, it will be readily understood that vehicles that can be allocated in accordance with the embodiments of the present invention may be inhabited or autonomous (unmanned), may be operated by an operator human in the vehicle and / or can be maneuvered remotely by a human operator and / or computer.
[0007] According to some embodiments, the vehicle allocation system allocates requested vehicle resources based on calculated scores for each vehicle. In some embodiments, the respective score of a vehicle may take into account one or more of the following: the current proximity of the vehicle to a hotspot, whether or not the vehicle is presently in an extended priority area or a priority environment, and / or the distance from a hotspot to the requested destination of the vehicle. According to one embodiment, the system reduces the vehicle score for requests that do not start within a hotspot, if the vehicle is at a distance from the hotspot. This increases the likelihood that vehicles that are not close to the hot spot are allocated to demand, and allows vehicles that are close to the trouble spot to remain available to be allocated to requests that begin within the hot spot. In some embodiments, the allocation system increases the score of vehicles of a type that is desired in a hotspot if the requested vehicle resource is to be assigned to a particular position (eg, a final destination of the vehicle). a assigned military or police patrol, a taxi reservation filing position) located in or near the hot spot with respect to the score of vehicles of a different type.
[0008] In one or more embodiments, the present invention relates to the allocation of vehicles to rental vehicle reservations with driver and particularly relates to the automatic attraction of rental vehicles with driver to satisfy customer reservations in a region. Sensitive point of demand for 15 relatively high effective or predicted rental vehicles with driver. If the vehicles are properly positioned, the instantaneous reservations (the bookings that request a vehicle as soon as possible) can then be satisfied relatively quickly because the journey time from an available vehicle to the collection position of the reservation is relatively short, and advance bookings can also be more efficiently fulfilled. It also helps to minimize the distances traveled by fleet vehicles, reduce fuel costs, improve vehicle use, reduce wear and reduce driver fatigue. Greater customer satisfaction and the well-being and happiness of drivers are other benefits.
[0009] According to some embodiments, a vehicle resource allocation controller device for allocating vehicle resources is in communication with a plurality of vehicle resource devices and a plurality of requesting devices, is adapted to perform a vehicle resource allocation module for dynamically allocating vehicle resources (eg in response to requests from requesting devices) by performing one or more of the operations described in this disclosure. In some embodiments, the vehicle resource allocation controller device controls the positions of the plurality of vehicle resources (eg, by receiving geoposition information on the position of a resource resource device). vehicle associated with the vehicle resource).
[0010] In accordance with some embodiments, the network vehicle resource allocation systems provide one or more of the following: a plurality of vehicle resource devices (e.g., each vehicle resource device being associated with a respective vehicle resource of a plurality of vehicle resources); a plurality of requesting devices (eg each calling device being associated with a respective one of the vehicle resources); a vehicle resource allocation controller device; a database of priority positions ('hot spots'); A vehicle resource allocation module; a vehicle resource database; a position control module of the vehicle resources; a priority position module for managing the information relating to and / or defining the hot spots; A map and / or position database; and / or at least one positioning service (e.g., global positioning service (GPS), Wi-Fi network positioning service In accordance with some embodiments, the systems, methods, apparatus and media computer-readable for allocating network vehicle resources to: identify a priority position; determine an extended priority area associated with the priority position; receive (eg from a calling party device) a supply request Of a vehicle resource at a first position; receive a second request for providing a vehicle resource at a second position; and allocate a vehicle resource of the plurality of vehicle resources to at least one of one of the first position and the second position, according to the extended priority area.
[0011] In accordance with some embodiments, the computer-readable systems, methods, apparatus, and media for allocating network vehicle resources permit: receiving a request to send a vehicle resource to a first position; Determining that the first position is outside a priority position; for each of a plurality of vehicle resources, determining whether or not the vehicle is in an extended priority area associated with the priority position; and for each vehicle resource in the extended priority area, determining a respective priority environment score. In accordance with some embodiments, the computer-readable systems, methods, apparatus and media for allocating network vehicle resources permit: receiving a request to send a vehicle resource to a first position; identify a vehicle resource of a plurality of vehicle resources; determining that the vehicle resource is in an extended priority area associated with a priority position; determine whether or not the vehicle resource is available and may or may not be allocated; determining a distance in: if the vehicle resource is presently available and can be allocated, determining a distance from the priority position to a current position of the vehicle resource, ie 3033066 9- if the vehicle resource does not is not presently available and can not be allocated, determining a distance from the priority position to a previously assigned destination of the vehicle resource; determining a priority environment penalty score of the vehicle resource based on the determined distance. In accordance with some embodiments, the computer-readable systems, methods, apparatus and media for allocating network vehicle resources permit: receiving a request to send a vehicle resource to a first position which is outside a priority position; identify a first vehicle resource of a plurality of vehicle resources; determining that the first vehicle resource is in an extended priority area associated with a priority position; determining a first distance from the first vehicle resource to the first position; identifying a second vehicle resource of the plurality of vehicle resources; Determining that the second vehicle resource is outside the extended priority area; determining a second distance from the second vehicle resource to the first position, the second distance being greater than the first distance; and select the second vehicle resource to allocate it on demand.
[0012] In accordance with another aspect of the invention, the computer-readable systems, methods, apparatus and media are capable of attracting vehicles (eg, first-responder vehicles, rental vehicles with drivers) to satisfy inquiries. (eg, police car delivery requests, customer reservations) in a hot spot region having a relatively high demand for vehicles, the method comprising: storing information relating to an active hot spot, the information identifying a region relating to the hot spot and information identifying an attraction distance to the sensitive point; automatically identifying that a request has a requested location (eg, a collection location) located outside the region identified as relating to the hot spot; for each of a plurality of vehicle resources capable of meeting the demand, calculating a vehicle fit score to satisfy the demand, computing a score comprising: 10 calculating subscores for each of several factors and performing a mathematical operation on the sub-scores, for each of the plurality of vehicle resources capable of meeting the demand, determining whether or not the vehicle is within the sensing point's pulling distance, and 15 for each vehicle determined to be within the attraction distance of the hotspot, calculating a hotspot attraction penalty score and including the hotspot attraction penalty score in the mathematical operation to produce a score for the vehicle; and using the scores calculated for the several vehicle resources to select a vehicle to be allocated on demand; and the allocation of the selected vehicle on demand. In accordance with another aspect of the invention, the computer readable systems, methods, apparatus and media are capable of attracting vehicles to meet requests having requested positions in a hotspot region having a relatively high demand for vehicles. the method comprising: storing information relating to a hot spot, the information including position information identifying a position relative to the hot spot; The automatic identification that a position relating to a request satisfies a requirement of relationship respectively to the position relative to the hot spot; the identification of several vehicles that can satisfy the demand; 3033066 calculating a hotspot attraction score for a first subset of the plurality of vehicles; non-calculating a hotspot attraction score for a second subset of the plurality of vehicles, the first subset not intersecting the second subset; using the hot spot attraction scores to calculate the vehicle scores of the first subset with respect to demand; calculating vehicle scores of the second subset of vehicles relative to the demand; Using the scores calculated for the several vehicles to select a vehicle to be allocated on demand; and the allocation of the selected vehicle on demand. In accordance with another aspect of the invention, the computer readable systems, methods, apparatus, and media can attract vehicles to satisfy requests (eg, customer reservations) in a hot spot region having a actual or intended application of vehicles, the method comprising: storing information relating to a hot spot, information identifying a position relative to the hot spot and information identifying one or more types of vehicle, the one or more types of vehicle indicating the types of vehicles that must be lured to the hotspot; automatically identifying that a request has a destination (eg, a deposit position for a customer reservation) that is at or near the location of the hot spot; The identification of several vehicles that can satisfy the demand; calculating a hotspot attraction score for a first subset of the plurality of vehicles, the first subset of vehicles comprising only vehicles associated with a vehicle type that corresponds to a type of vehicle included in the information sensitive point; The non-computation of a hotspot attraction score for a second subset of the plurality of vehicles, the first subset not intersecting the second subset; The use of the hot spot attraction scores to calculate the vehicle scores of the first subset with respect to the demand; calculating scores for vehicles of the second subset of vehicles with respect to demand; Using the scores calculated for the several vehicles to select a vehicle to be allocated on demand; and the allocation of the selected vehicle on demand. Other aspects of the invention provide corresponding computer-readable apparatus, computer programs and media for performing any of the methods of the present disclosure. Some embodiments include computer programs comprising machine-readable instructions which, when executed by a computer apparatus, cause the computer apparatus to perform any or all of the described methods of allocating a vehicle resource to a future need for a vehicle. Some embodiments include a computer-readable, non-transitory storage medium on which computer readable code (eg, computer software instructions) is stored, which, when executed by a computer apparatus, causes the computer apparatus to performing any or all of the described methods of allocating a vehicle resource to a future vehicle need. Some embodiments include an apparatus having at least one processor and at least one memory on which computer readable code is stored which, at its execution, controls the at least one processor to allocate a vehicle resource to a future need for vehicle by performing the steps of one or more of the described methods.
[0013] Figure 1 is a block diagram of an exemplary management system of a plurality of vehicle resources according to various aspects of the present invention. As illustrated in Figure 1, an exemplary system 10 includes a number of interconnected components, described below. The system 10 includes a central vehicle resource allocation system 12. The system includes one or more server computers that execute system software for smooth operation of the system 10. In accordance with certain embodiments of the system. the central vehicle resource allocation system 12 may comprise one or more vehicle resource allocation controller devices. One or more of the represented components of the system 10 may be in communication with at least one other component by means of one or more communication networks, such as the example of the communication network 13. The key functions of the system 10 comprise the allocation of vehicle resources from a plurality of vehicle resources (eg, first responder vehicles, public or private security vehicles, military vehicles, chauffeured rental vehicles) to at least one particular required position (eg eg a reservation for collecting and depositing a passenger). As discussed in more detail with respect to system example 100 (Figure 8a and Figure 8b), other functions may include vehicle and driver management, account management, and / or record keeping.
[0014] The request function may be fulfilled, in some embodiments, by using one or more requestor devices 2oa-c in communication with one or more request servers 21 (eg, a request web server, an application server, or a request server 21). application, and / or a call center terminal) in communication with the central system 12. The allocation function is mainly performed by a vehicle resource allocation module 15, with information from others. parts of the system 10.
[0015] In some embodiments, the priority position module 19 performs one or more of: determining information relating to the hot spots and other priority positions (eg, by requesting a priority position database 16), the defining hot spots dynamically and / or in response to a user input (eg, hot spot definition information received through a user interface), and providing one or more user interfaces for receiving, transmitting and managing information relating to hot spots (eg 3033066 - 14 - attraction distances, periodicity information). In some embodiments, a control of vehicle resource positions (eg vehicle position control, associated vehicle resource devices, and / or drivers) is provided primarily by a control module of the vehicle resources (eg vehicle position control, associated vehicle resource devices, and / or drivers). positions of the vehicle resources 17, with reference, where appropriate, to the vehicle resource database 14, the vehicle resource devices 22a-c, and / or one or more positioning services 24, as well as to other components of the system 100.
[0016] The system 10 may include one or more database functions, such as a vehicle resource database 14, a priority position database 16, and a position database 18. The database The vehicle resource resource 14 includes vehicle resource information managed by the system 10. The priority position database 16 includes information on the hot spots identified in the system 10, and may include information about priority areas. ranges associated with hot spots, attraction distances, and / or other types of parameters associated with defined hot spots. The location database 18 may include maps and / or other types of information describing the locations at which vehicle resources may be allocated (eg, street addresses, GPS coordinates, points of interest, etc.). .). Certain other types of database that may be suitable for certain desired embodiments are further described with respect to Figure 8a and Figure 8b.
[0017] The system 10 may further comprise one or more types of positioning services 24, such as GPS systems and / or other types of device positioning services that can be used to determine the positions of any of the positioning devices. Applicant 20a-c and / or vehicle resource devices 22a-c. Each of the vehicle resource devices 22a-c may be associated with a respective vehicle resource. A vehicle resource device may consist of a mobile computing device, a smart phone, a GPS component and / or a communications device configured to determine a position of a vehicle resource and / or transmit to the device. vehicle resource information about the races and destinations allocated (eg, to transmit a destination assigned to the driver of a vehicle).
[0018] Figure 2 is a block diagram of an exemplary geographic region having a plurality of vehicle resource locations to be served, and priority environments, in accordance with various aspects of the present invention. The geographical region example has hot spots 202 and 206. Each of the hot spots is associated with a region related to hot spot 204 and 208, respectively. In some embodiments, the sensing points 202 and 206 may be specific positions; in some embodiments, the 'hotspot' may refer to the entire region relating to the hotspot. As shown in Figure 2, each of the sensing points 202 and 206 is associated with an extended priority area 205 and 209, respectively. In this example, each extended priority area 205 and 209 is defined by a priority radius or attraction distance 203 or 207. In FIG. 2, the illustrated geographic region example includes a plurality of vehicle resources represented by k, and a plurality of particular positions 230a-n. The vehicle resources 22a-k may represent, for example, the current positions of vehicles managed by a vehicle resource allocation system. The particular positions 230a-n may represent, for example, the positions of applicants (and / or potential applicants) and / or the positions to which a vehicle resource (e.g. an accident for an ambulance, a position of deposit of a passenger). As shown in Figure 2, some vehicle resources may be within sensitive points / sensitive point regions, within larger priority areas but not within the associated hotspot, and outside of the high priority areas (eg, outside the attraction distance from a hotspot). In some embodiments, a geographic region such as that illustrated in Figure 2 may be represented in one or more user interfaces (eg, to view the positions of vehicles, applicants, and / or points). sensitive) to administer a vehicle resource allocation system.
[0019] Figure 3 is a flowchart illustrating an exemplary method of allocating a vehicle resource according to an extended priority area according to various aspects of the present invention. The method 300 may be executed, for example, by a server computer (e.g., a vehicle resource allocation controller device). In accordance with some embodiments, the method 300 may include identifying a priority position, at 302, and determining an extended priority area associated with the priority position, at 304. Some examples of sensitive point definition (and associated attraction distances) are described in the present disclosure with respect to Figure 10 and the calculation of skew attraction scores (at 1007). In some embodiments, the method 300 may include receiving a request to provide a vehicle resource at a first position at 306, and receiving a request to provide a vehicle resource at a first location. second position, at 308. In one example, a vehicle resource request may be received by a request server and / or a vehicle resource allocation system from a requesting device (eg by a user using a smart phone application). Various types of vehicle resource requests are described in this disclosure. In one example, the receipt of requests may include a request that a vehicle resource go to the first position and then to the second position, as in a request to transport goods or passengers from a collection position to a position delivery, or a search vehicle visits the first position then the second position. In another example, receipt of requests may include separate requests (eg 3033066 -17- by the same or different applicants) for the respective positions. In accordance with some embodiments, the method 300 further comprises allocating a vehicle resource, among a plurality of vehicle resources, to at least one of the first position and the second position, after the extended priority area, at 310. Various examples of vehicle resource allocation based on attraction distance information and other aspects of the extended priority areas are set forth in this disclosure.
[0020] Figure 4 is a flowchart illustrating an exemplary method 400 for allocating a vehicle resource based on proximity to a priority position, in accordance with various aspects of the present invention. The method 400 may be executed, for example, by a vehicle resource allocation controller device. According to some embodiments, the method 400 may include receiving a request to send a vehicle resource to a requested location, at 402, and determining that the requested position is out of a position. In one example, a vehicle resource allocation system may receive a request to send a vehicle to a desired position that is not within a defined hotspot. The method 400 may further comprise, for each of a plurality of vehicle resources, determining whether or not the vehicle resource is within an extended priority area associated with the priority position at 406. For example, as disclosed in the present disclosure, a vehicle allocation system can determine the current positions of all vehicles in its fleet, and determine that a vehicle is outside of a hotspot but below an attraction distance of the sensitive point, or is within a defined priority area defined and associated with the sensitive point. In certain embodiments, the method 400 may further comprise, for each vehicle resource within the extended priority area, determining a respective priority environment score, in 408. In a for example, a priority environment score represents a score reduction, or other weighted measure, for use in assessing the suitability of a given vehicle resource for a vehicle resource request (e.g. compared to other vehicle resources). As set forth in this disclosure, a priority environment score may include a penalty score (eg, a skew point penalty score) for reducing the likelihood that a vehicle resource will be located. within an extended priority area be chosen rather than other vehicle resources (eg, vehicles that are not currently in the extended priority area). As also disclosed in the present disclosure, in some embodiments a penalty score according to an extended priority area may be used (as a sub-score) in combination with one or more other types of sub-scores to determine a score (e.g., an overall or total score) of a vehicle resource. Figure 5 is a flowchart illustrating an exemplary method of allocating a vehicle resource based on proximity to a priority position, in accordance with various aspects of the present invention. The method 500 may be executed, for example, by a vehicle resource allocation controller device. In accordance with some embodiments, the method 500 may include receiving a request to send a vehicle resource to a requested location, at 502, identifying a vehicle resource, at 504, and determining whether or not the vehicle resource is in an extended priority area at 506. If the vehicle resource is in an extended priority area, the method 500 may further include determining whether or not the vehicle resource is Currently available (or currently assigned a position), at 508. If the vehicle resource is not in an extended priority area, the process may proceed to 516, as further described below. In one or more embodiments, the method 500 may further include determining a distance associated with the vehicle resource. If it is determined (at 508) that the vehicle resource is presently available and can be allocated, the method 500 may include determining a distance from the priority position to a current position of the vehicle resource, Alternatively, if the vehicle resource is unavailable and can not be allocated, the method 500 may include determining a distance from the priority position to a previously assigned destination of the vehicle resource. , in 512.
[0021] The method 500 may further comprise determining, at 514, a skew point attraction score based on the distance determined at 510 or 512. The method 500 may further include determining a score. to allocate the vehicle resource to the requested position (e.g., according to the hot spot attraction penalty score and at least one other sub-score of the vehicle resource), at 516. Various formulas of determination of the skewed attraction penalty scores and the total or overall scores of the vehicle resources are described in this disclosure.
[0022] Fig. 6 is a block diagram of an exemplary geographical region having a priority environment, according to various aspects of the present invention. The geographical region example includes a hot spot 602 with an associated area relating to the hot spot 604, and an extended priority area 605 defined by the pulling distance example 606.
[0023] In Figure 6, the illustrated geographical region example includes a plurality of vehicle resources represented 620a-c, and a plurality of particular positions 630a-e. The vehicle resources 620a-c can represent, for example, the current positions of vehicles managed by a resource allocation system of 30 vehicles. The particular positions 630a-e may represent, for example, the positions of applicants (and / or potential applicants) and / or the positions at which the vehicle resource is requested to travel. In one example, a request to collect a passenger at the position 630a can be associated with a deposit position at 630e. Each of the 620a-c vehicle resources represented can then be evaluated for on-demand assignment. For example, in accordance with some embodiments, in spite of the fact that 620a and 620b are closer to the collection position 630a than 620c, 620a and 620b are within the extended priority area 605 around the hotspot 602. As a result, a vehicle resource allocation system could penalize the 620a and 620b vehicles when it considers them to satisfy the demand (eg by using a penalty point attraction score as is described in Figure 514), and selecting the vehicle 620c to collect the passenger although the vehicles 620a and 620b could have reached the collection position 630a earlier. In this way, however, according to some embodiments, the allocation system can improve the overall efficiency of the system as well as the availability and speed of response of the vehicles to requests, by maintaining a greater number of vehicles in the system. extended priority area. By automatically maintaining a larger number of vehicles in the priority environment (without necessarily explicitly sending vehicles into the priority environment), overall travel times can be reduced by increasing the availability of vehicles to be allocated to requests to and / or from the hotspot and 20 neighboring areas. In some embodiments, a geographic region such as that illustrated in Figure 6 may be represented in one or more user interfaces (eg, to view the positions of the vehicles, the applicants, and / or the hot spots) to determine the location of the location. administering a vehicle resource allocation system. Fig. 7 is a flowchart illustrating an example of method 700 for allocating a vehicle resource based on proximity to a priority position, in accordance with various aspects of the present invention. The method 700 may be executed, for example, by a vehicle resource allocation controller device. As discussed above with respect to Figure 6, in some cases a vehicle resource allocation system may allow the selection of a particular vehicle resource to be allocated to a vehicle request, even if another vehicle is closer at the time of the request, in order to effectively maintain the vehicle resources within an extended priority area, a hotspot, or a priority environment.
[0024] According to some embodiments, the method 700 may comprise receiving a request to send a vehicle resource to a requested position outside a priority position, at 702, identifying a first vehicle resource (e.g., a plurality of vehicle resources) at 704, and determining that the first vehicle resource is within an extended priority area associated with the priority position, 706. The method 700 further comprises, in some embodiments, determining a first distance from the first vehicle resource to the requested position, at 708.
[0025] In some embodiments, the method 700 may further include identifying a second vehicle resource (e.g., the plurality of vehicle resources), at 710, determining that the second vehicle resource is located outside the extended priority area, at 712, and determining a second distance from the second vehicle resource to the requested position, the second distance being greater than the first distance, at 713. The method 700 may further comprise, in accordance with one or more embodiments, selecting the second vehicle resource (the one furthest from the requested position) to be allocated to the request, at 714.
[0026] As discussed above, various types of vehicle resource allocation systems may allow the allocation of different types of vehicles (eg, first responders, remotely controlled aircraft) according to the priority environments, and may Effectively attract vehicles to sensitive points and / or associated extended priority areas without specifically sending vehicles to a sensitive point. Figures 8a, 8b, 9, 10 and 11 and their description below further develop the management of vehicle resources relative to hot spots, using a non-limiting example of a rental car service with driver. Fig. 8a is a block diagram of a rental car rental service management system according to various aspects of the present invention.
[0027] The system 100 has a number of interconnected components, which will now be described. The system 100 comprises in its heart a central system 101. It comprises one or more server computers that run software ensuring a smooth operation of the system 100.
[0028] The key functions of the system 100 are reservations, allocation of a rental car with driver to a reservation, vehicle and driver management, account management and record keeping.
[0029] The reservation function is provided primarily by a reservation web server 102, a reservation application server 103 and call center terminals 104A and 104B, all of which are coupled to the central system 101. The allocation function is provided primarily by a run allowance module 105, with information from other parts of the system 100. The system includes database functions. In particular, an operational database 130 stores the data relating to the overall operation of the system 100. A driver network database 131 stores the data relating to the drivers and vehicles that are managed by the system 100. Finally , a historical database 132 stores the data of the operational database 130 that has been archived. An archive of the data of the operational database 130 in the historical database 132 is performed periodically and only the data no longer having any general operational use are archived. The vehicle and driver management function is provided mainly by a driver position control module 106 and a driver server 107, with reference to the driver network database 131 as well as to the driver database. other components of the system 100.
[0030] The account management function is provided primarily by an account management module 117, using the account information stored in the operational database 130 as well as by other components of the system 100. The operational database 130 stores the data of each open account 10 with the system operator 100. Each account is identified by an account number stored in the operational database 130. The account information stored in the operational database 130 may also include an account name, such as the name of a company, and the contact information of the company. The account information stored in the operational database 130 stores the credit card information and / or other payment information so that the payment can be withdrawn from the cardholder's account if authorization is given. A password and / or PIN (personal identification number) is associated with each account and stored with the account information in the operational database 130. In addition, a list of persons authorized to make reservations on the account can be memorized, as well as optionally the profiles of authorized persons. The account information stored in the operational database 130 may also include the name of a contact and the telephone number of a person to contact in case of problems with the account. The account information stored in the operational database 130 includes information about the billing preferences, for example the frequency of the invoices, the date on which the invoice is to be sent, the monthly / weekly credit limit, and the information of each reservation to be included on the invoice. The account information stored in the operational database 130 may indicate that an account is active or has been suspended. An account can be put on hold by a financial control department, which prevents other bookings from being made to the account. Historical expense data on the account can also be stored in the operational database 130, or in the historical database 132. The record keeping function is provided mainly by the database 5. 132, although the operational database 130 and the driver network database 131 also provide a certain record keeping function. In a nutshell, a fleet of rental vehicles with driver is managed by the system 100. Each vehicle is recorded respectively in the driver network data base 131, which will now be described. The driver network database 131 stores information about each vehicle in the fleet. The registration number (license plate number) of each vehicle is stored in the driver network database 131.
[0031] This can be used to identify each vehicle. Alternatively or additionally, a unique unique identifier of the registration number may be assigned to each vehicle as the primary identification means in the driver network database 131.
[0032] Each service is defined according to its type of vehicle, capacity and other characteristics. In some embodiments, these types are "Up to 4 passengers", "Up to 7 passengers", "Electric vehicle", "VIP" and "Up to 4 passengers with luggage". The driver network database 131 stores the type of each vehicle and can also store a corresponding number or short string of characters to represent each type. Any special equipment such as a baby seat or the ability to accept a wheelchair is also identified in the driver network database 131. The driver network database 131 indicates the current driver to which the car is assigned, although the driver / vehicle allowance changes from time to time.
[0033] The driver network database 131 stores the make and model and optionally the color of each vehicle. The driver network database 3033066 - 25 - 131 also indicates the current status of the vehicle. In some embodiments, the status is selected from "Park drivers", meaning that the car is used by a driver, "Free Park", meaning that the car is currently unused and can be allocated to a driver and "Workshop" who means that the car is undergoing overhaul or undergoing repair. The driver network database 131 also stores the Public Carriage Office license number of each vehicle and the date of lapse of this license and the dates of lapse of road tax, vehicle insurance. and technical control if necessary. Examples of other data that can be stored are the date of purchase of the vehicle, its purchase price, its date of manufacture, the supplier of the vehicle, the warranty information and the date of the last inspection / maintenance. Historical data on each vehicle may also be stored in the driver network database 131, such as a record of prior registration numbers and a record of previous drivers assigned to the vehicle. Revision history and accident or repair information can also be stored. The fleet of rental vehicles with driver is used by a group of 20 drivers, each of which is registered in the driver network database 131. The driver network database 131 stores information on each of the drivers registered in the operator. The driver information includes personal data such as name, contact information (phone number, home address), date of birth, closest relative, and driver's account data. . Driver status information may be stored to indicate that a driver is active or inactive, whether a vehicle has been allocated to the driver or not. Each driver can also receive an individual and unique identifier as a means of identification. Call signs may also be used to designate the drivers and are stored in the driver network database 131, although the call signs may be changed and reassigned between the drivers as long as the same number of drivers is used. call sign is not used by two drivers at the same time. A driver's account data includes an account number. Other information may include information on the driver's road insurance, 5 his length of service in the fleet, parking fines, historical information on his salary, his leave, his travel record, information on his collections. races, driver's license number, social security number, taxi driver's license (such as the Public Carriage Office permit), banking information (account number, agency code, etc.). Various information such as information on possible allergy, smoker / non-smoker etc. may also be stored in the network of drivers network 131. Information about the equipment of a driver such as a serial number of a driver device 110 assigned to the driver, the mobile phone number of the device of driver 110 as well as the driver's private mobile phone number can also be registered. Statistical information such as the date of the last race or historical income data may be recorded in the driver network database 131 or in the historical database 132.
[0034] The information concerning the payments made to the drivers and collected from them can be memorized in the network of drivers network 131. Payments to the driver include his salary. The driver's disbursements may be, for example, car wash fees, insurance premiums, taxi driver's license renewal premium, vehicle repair costs, car rental fees. To help maintain this information, a purchase book number and a contract number for each driver can be stored. Each driver has an associated driver device 110, three of which are shown at 110A, 110B and 110C in the Figure. The driver devices 110 are portable electronic devices with wireless communication capabilities. The driver devices 110 may take any form but typically are smart phones or personal digital assistants or the like. The driver devices 110 include a display and one or more information input devices such as a keyboard, a voice control module or a touch screen or any combination thereof.
[0035] The driver devices 110 are connected to a driver server 107 via a radio network 111, which may for example be a mobile telephone network (cellular telephony). In this case, the driver devices 110 are subscribed to the mobile telephone network so as to be able to send digital data to the driver server 107 and receive therefrom. In addition, the driver devices 110 and the driver device server 107 may exchange messages by other means, in particular SMS messages (short message service) and optionally also MMS messages (multimedia message service).
[0036] Alternatively, the radio network 111 may be a dedicated radio network, for example a private mobile telephone network or a private radio network of another type. The driver devices 110 and the driver server server 107 may exchange data on any suitable communications link, for example the data channel of a cellular telephone network such as a GSM, EDGE, GPRS network. , UMTS, HsxPA or LTE. The driver devices 110 are configured to signal their positions to the driver network database 131 at regular intervals, for example every 30 seconds. The driver devices 110 include GPS (Global Positioning System) receivers, which calculate the positions of the driver devices 110 under the control of the software applications executed on these driver devices 110. Alternatively, they may include another module or device positioning device 30 for calculating the positions of the driver devices 110 with an appropriate level of accuracy and resolution. 3033066 - 28 - A customer can book a rental car with driver in three different ways. First, he can make his reservation by telephone to a call center operator. In this case, the customer calls the call center and is put in contact with an agent who controls one of the computer terminals 104A and 104B 5 of the call center. The call center agent then proceeds to the booking of the rental vehicle with driver in the terminal 104A, 104B in accordance with customer needs. The needs of the client are obtained verbally during the telephone conversation between the client and the agent.
[0037] According to the second option, the customer can book a rental vehicle with driver through a browser application on a computing device 113, three examples of which are shown in 113A, 113B and 113C in the Figure. Each of the computing devices 113 is connected to the reservation web server 102 by a network 114, which may be for example the Internet or another public or private network. The reservation web server 102 includes a web server functionality which causes the browser of the terminal 113. to display appropriate web pages. The customer's needs with respect to the rental car rental reservation are obtained by the web server of reservation 102 which sends to the computer terminal 113 pages intended to be filled with the customer information. The client 20 provides this information by free text input using drop-down lists, radio buttons, and so on. Some information may be pre-filled in the pages provided by the reservation web server 102. Reservation through the reservation web server 102 may require the customer to connect to a web portal to be able to make his reservation. This connection may require the entry of a user name and password or a PIN number. The control of a web session by the reservation web server 102, for example by using cookies provided to the computer terminals 113, may determine that the reservation made is valid by establishing that the client was connected to the reservation web server at the time where the reservation was made. The last way a customer can book a rental vehicle with driver is through a dedicated software application that is installed and run on a portable communication device 112, three of which are shown in 112A, 112B, and 112C. in Figure 8a. Portable communications devices 112 may be of any suitable form, but typically are smart phones, feature phones, computer tablets or personal digital assistants or the like. The communication devices 112 are coupled to the reservation application server 103 by a radio network 111, which may be the same as the radio network 111 described above with respect to the driver devices 110 and the driver devices 107.
[0038] The application is configured to provide a user interface that allows the customer to give the software application the information required to proceed with the reservation of the rental vehicle with driver. For example, the software application, at its execution, may result in the display of interactive pages that allow the client 15 to select or enter the required information. The software application is also configured to communicate reservation information that has been provided by the client to the reservation application server 103. If, according to the information provided by the client, it is determined that the application server of reservation 103 requires further information, the software application executed in the mobile device 112 is configured to provide an interactive display to the client so that the client can provide this information, after which the software application provides them to the server. 103. Prior to making a reservation, the client may need to connect to the software application on the mobile device 112. The connection to the software application may require the entry of a username and a password. password or PIN number. Alternatively, the user name can be entered during the establishment of the application and not have to be entered later in the execution of this software application. If it is not necessary to enter a user name, the user can log on to the software application simply by entering his password or PIN. The information on booking a rental vehicle with driver 3033066 -30- obtained during the booking process is as follows: - Customer information. The customer information may be the customer's name or an identifier that uniquely identifies the customer in the operational data base 130. - The type of service. This indicates the category of vehicles. For example, the type of service may indicate a vehicle of a standard four-seater type, or a standard seven-seater vehicle. The service may alternatively indicate a VIP vehicle, or an environmental protective vehicle (electric or hybrid) (also called green vehicle). - The type of trip. The type of trip can be one way, or can be a round trip. The path may alternatively be a path having multiple collection positions or multiple deposit positions or multiple collection positions and multiple deposit positions. The type of trip may alternatively indicate that it is a collection at an airport or a depot at an airport. - The collection address. This is the address to which the customer must be collected at the beginning of the journey. The address is a natural language address. The address is selected from the plurality of addresses stored in a database. The addresses may be stored in the operational database 130 or in the historical database 132, or may be provided by an external address database service, for example geo.me or qas.co.uk. Each address is associated with position coordinates expressed in latitude and longitude. Multiple databases can be used (hierarchically) for address lookup. The collection address may be selected by the customer in any convenient manner, depending on whether the customer uses the software application on his mobile device, uses the reservation web service or uses an agent in a data center. calls. If the trip type is a collection type at an airport, the collection address indicates the airport and terminal and optionally the flight number. 30 - The deposit address. The deposit address is also selected from multiple addresses stored in the database and is selected by the customer in any convenient manner. If the trip type is an airport depot, the collection address indicates the airport and the terminal and optionally the flight number. - The date and time of collection. These indicate the time and date on which the customer wishes to start the journey. Alternatively, the date and time may indicate 5 DQP (as soon as possible), if the customer wants the rental vehicle with driver as soon as possible. Other optional information may appear on the reservation, such as: - A customer reference. This may be for example a free text or a text 10 selected in a drop-down menu. If a reference is provided, this information may be included in an accounting statement of a trip at a later date. - Additional comments. Namely, a free text that brings potentially relevant information, and that can be communicated to the driver once the reservation has been allocated. The system 100 includes a path cost calculation module 122. The path cost module 122 executes a software code that determines the price of a requested path during the reservation process and before the vehicle allocation. The calculation of the cost of the trip is made at the time of booking and the result is returned to the customer making the reservation. The resulting cost of the trip is provided before the customer confirms the reservation. The path cost calculator 122 calculates the base cost of the trip in a variety of ways. The module 122 can set a fixed price for certain journeys. These are agreed in advance with a particular account holder for journeys between predetermined points. The path cost calculation module 122 verifies that the reserved trip and the customer meet the parameters of a fixed fare. If the conditions are not met, another pricing process is used. The cost calculation module of path 122 may use a rate per zone if a fixed rate is not used. When each point of the trip is in a defined zone, the zone rate can be used. If neither the fixed rate nor the zone rate is used, or if the conditions for their application are not met, the path cost calculation module 122 may use a tariff method of A to 3033066. B (AB). Process A-B can specify the number of units between points A and B. A price unit that depends on the type of vehicle etc. is then used to calculate the tariff, if no AB data exists for a particular trip, the distance to (direct) bird's eye flight (ie the length of a straight line between the collection position and deposit position) is used to calculate the base cost of the trip. This method can use map references or alternatively rely on GPS data, i.e. the latitude and longitude of the collection and deposit points.
[0039] The path cost calculation module 122 can recover all the map and position information necessary to make these calculations from the historical database 132. The historical database 132 can store a detailed geospatial model of a particular region, such as a city. Alternatively, or in addition to the methods described above, the path cost calculation module 122 may use the true road distance of the path, which is calculated using the historical database road map 132 and an algorithm. route planning. Different rates can be used for different parts of the same trip. For example, a first fare per mile can be used for the first 10 miles of a trip and a second fare per mile can be used for the rest of the trip. The historical database 132 can also store information about speed limits and historical traffic data. This information can also be used by the path cost calculation module 122 to calculate an estimated duration of the trip. The estimated travel time can then form the basis of the cost calculation.
[0040] Other criteria used by the journey cost calculation module 122 when calculating the price are the type of vehicle (VIP, green, 7 seats etc.) including any special equipment available to the vehicle, the payment method. and the date and time of the trip. The journey cost module 122 can also apply a fixed "collection fee" for each trip.
[0041] The journey cost calculation module 122 may also determine the portion of the billed charge to the customer that is returned to the driver. This can be a simple percentage of the total run or a more complex calculation depending on one or more factors such as the journey time, distance, waiting time and the number of passengers. The allocation function allocates a vehicle and a driver to a reservation. The allocation function is described in some detail below. In a nutshell, a vehicle and a driver are allocated to the reservation, and to the associated customer, taking into account a number of factors including the collection position specified in the reservation, the deposit position specified in the reservation, the type of service specified in the reservation, the date and time specified in the reservation, the geographical distribution of the vehicles that are managed by the system 100, the demand for the vehicles that are managed by the system 100 and the information concerning the drivers. The allocation function is automatic in that it does not require any manual intervention once the reservation has been made. Once a race has been allocated to a particular driver and a particular vehicle, it is recorded in the operational database 130 with an indication that the journey has not yet been made.
[0042] The vehicle and driver management function ensures a certain number of checks of a vehicle in terms of distance traveled, etc. and mechanical maintenance required at regular intervals. It also verifies that drivers' documentation regarding rental vehicle licenses, insurance etc. are in order. In addition, this function maintains an archive of the hours worked and the races performed, as well as any other relevant information. The Account Management function is used to manage customer account information with the System 100 Operator. This covers the maintenance and management of information such as authorized users, credit limits, terms and conditions. billing, etc. The record keeping function stores various information that is created or found by the system 100. This information includes information on the reservations not yet satisfied, which are included in the operational database 130.
[0043] The sequence of steps executed by the system during the running of a race is now described in relation to FIG. 9. This shows the execution of a relatively simple race having a collection position, a deposit position. , no driver reallocation and no path variation. This figure does not cover the cost and billing of the trip either.
[0044] The operation begins at step 901. At step 902, the system 100 accepts a reservation. Other ways of accepting a reservation are described above with respect to Figure 8a.
[0045] In step 903, the reservation is confirmed to the customer, for example by email. The message sent to the customer by the system 100 includes a reservation reference number and some or all of the reservation information, including the collection and deposit locations, the date and time of collection, etc.
[0046] In step 904, the system 100 saves the reservation until it is time to begin the allocation. For a DQP race, the allocation can start immediately. Otherwise, the allocation may begin at a fixed time before the collection date and time specified in the reservation information, as described in more detail below. At step 905, the system allocates a driver and a vehicle to the race. This is described in relation to Figure 10 and Figure 11 below. When the vehicle is allocated, the status of the vehicle and the driver changes from 'available' to 'allocated'. This prevents the vehicle / driver from being allocated to a different race as long as the status does not change to a proper status. In step 906, the system 100 sends a message to the client with the details of the allocated vehicle. The message includes text such as 'your vehicle is on the road'. The message also indicates the race number, which may be the same as the number of the reservation. The message also indicates the identity of the vehicle, so that it can be easily identified by the customer. The identity of the vehicle may be indicated for example by the license plate or license plate on the vehicle. It may also indicate the make and model of the vehicle and / or its color. In addition, the message includes information allowing the customer to contact the driver who has been allocated to the race. For example, it may include the mobile phone number of the driver. Having the driver's mobile phone number allows the customer to call the driver before he picks it up in case he has any comments or clarification. In addition, the message includes a hyperlink to a web page on which the vehicle's position is displayed on a map. This allows the customer to check where the vehicle is at any time between the vehicle's allocation to the race and the customer's collection by the vehicle. In step 907, the system 100 sends a message to the driver informing him about the race. The message contains various pieces of information including the client's name. This allows the driver to confirm the customer's identity when he encounters it at the collection position. The message also includes the collection position and the deposit position. The collection position and the deposition position may be provided in the message so that it can be retrieved by the driver device 110 and placed automatically in a navigation application that is present on the driver device 110. This allows the driver to the collection position to begin a route guidance after it has entered the collection position on the driver device 110. In the same way, after the customer has been collected at the collection position, the driver may instruct device 110 to begin guiding to the deposition position after an appropriate seizure on driver device 110.
[0047] The system may include a route planning module configured to execute a route planning algorithm. The route planning module can request the map and position database 109 to calculate a route. The route planning module may also request historical traffic data in the historical database 132 and / or instant traffic information to be able to more accurately predict the fastest route. Once a driver has indicated that he has collected the customer, the route planning module 5 can communicate the recommended route to the driver via the driver device 110. The route guidance can be in the form of a driver. navigation instructions. Having a centralized route planning and guidance system prevents the driver from having to provide his own navigation system and update it.
[0048] In step 908, the system 100 receives from the driver a PAB message (passenger on board). This message is transmitted by the driver device 110 in response to the indication by the driver that he has collected the customer at the collection position. The driver may opt to indicate the PAB status once the driver device 110 determines that the vehicle has arrived at the collection position, or is within a predetermined radius (eg 50 m) of the position of the vehicle. collection and is at a standstill. However, the sending of the message by the driver device 110 is not automatic. In this step, the status of the vehicle / driver changes from "Allocated" to "PAB".
[0049] After receiving the driver's PAB message, the system 100 at step 909 records that the client has been collected. Then in step 910, the system 100 receives from the driver a deposit message. This message is sent by the device 110 after the driver indicates to the driver device 110 that he has dropped the customer to the drop position. The driver may opt to indicate that he has dropped off the customer when the driver device 110 determines that the vehicle has reached the deposition position or is within a predetermined radius (eg 50 m) of the position of the driver. deposit and is at a standstill. However, the sending of the deposit message by the driver device 110 is not automatic.
[0050] After receiving the deposit message sent by the driver device 110 at step 911, the system 100 completes the path registration in the operational database 130 (the record was created during the reservation process) . The recording of the stored path in the operational database 130 includes the following information: the collection address and the deposit address, also the date and time of the collection and, if they are different. , the date and time of the reservation. The record also includes the date and time of deposit, as detected by the system 100 in response to the receipt of the deposit message sent by the driver at step 910. The record also includes the cost of the trip. in terms of financial value. The recording also includes the distance traveled, which is not the distance to (direct) bird's flight between the collection and deposit positions but the distance traveled by the vehicle. The recording also includes the duration of the trip, in minutes and seconds. The registration also includes the type of vehicle that indicates the type of vehicle that is traveling.
[0051] The registration also includes the reservation information relating to the journey, which may include information on the identity of the customer who made the reservation, the time at which the booking was made, the method of executing the reservation. (eg Web server, application or call center) and any other relevant reservation information.
[0052] Then, at step 912 the driver and the vehicle are reallocated to the available driver group. This is achieved by changing the status of the vehicle / driver from "PAB" to "available".
[0053] If applicable, in step 913, a receipt message of the traveled path is sent to the client. Finally, the operation terminates at step 914. A method of scoring a vehicle for a reservation is now described with respect to FIG. 10. The scoring process of FIG. 10 is executed by the allocation module. The operation starts at step 1001. In a few words, the different scores are calculated in steps 1002 to 1007, and the scores are added to step 1008. It will of course be understood that the Sample scores can be calculated in any order, and scores can be calculated entirely or partially in parallel.
[0054] In step 1002, a distance score is calculated. The distance score makes it possible to take into account the distance between a vehicle and the position of collection of the reservation when marking the vehicle for the reservation. The distance score is calculated as the distance between the current vehicle position and the collection position. This distance 10 is expressed in miles but can be calculated in kilometers. The distance is calculated as the distance the vehicle will have to travel to reach the collection position, taking into account road configuration, one-way traffic, etc. It is called road distance. The shortest route from the vehicle to the collection position is used as the distance, even if it is not the fastest route.
[0055] The road and its road distance are calculated, for example, using information from the historical database 132. Preferably, the last recorded position of the vehicle is used in calculating the distance score. An administrator or other person in charge of the system 100 may apply a parameter such that the distance score is always zero, in which case the distance between the vehicle and the collection position is not taken into account in the calculation of the score. In step 1003, a service compatibility score is calculated. The calculation of the service compatibility score takes into account the car type preference that has been specified in the reservation with respect to the type of vehicle currently being noted. If the type of vehicle currently noted is the same as the one specified in the reservation, or is consistent with that type, then the service compatibility score is zero. The service compatibility score is a positive value in case of incompatibility between the type of service of the reservation and the type of vehicle currently being noted. In the case of a reservation specifying a VIP vehicle, and if the currently noted vehicle is a standard vehicle, a penalty of 500 may be applied as the service compatibility score. This penalty helps to ensure that a VIP vehicle will be provided to meet the booking if it is available, but in the absence of a suitable vehicle, a standard car may then be provided. In the case of a reservation specifying a standard four-seater vehicle, a penalty score of 50 points is applied to a seven-seater vehicle. This helps to ensure that the reservation is served by a suitable car, but also helps to avoid the unnecessary exit of a large vehicle from the available fleet of vehicles. In the case of booking a standard car while the vehicle type is a 10 VIP car, a penalty score of 100 is applied. As with the situation described in relation to the larger capacity vehicle, this helps to ensure that the reservation is satisfied without unnecessarily leaving VIP vehicles from the available fleet. At step 1004, a non-occupancy score is calculated. The non-occupancy time score allows for consideration of the use of the vehicle (and the corresponding driver) in the vehicle's rating relative to the reservation. The non-occupancy duration score is calculated as the product of -1 and the duration (in minutes) since the completion of the last race allocated to the combination 20 car / driver and a cost per minute of non-occupation. occupation. The cost per minute of non-occupancy is actually a weighting factor. The weighting factor can be set by a system administrator 100. For a vehicle with PAB status, the non-occupation time score is zero.
[0056] The inclusion of a non-occupancy time score in the operation of Figure 10 helps to ensure load balancing of the vehicles, and load balancing of the drivers. Vehicle load balancing helps to standardize the wear of different fleet vehicles per unit of time. Driver load balancing is useful because it prevents drivers from running too many consecutive races with insufficient rest between races, and also helps to reduce the possibility of drivers waiting too long between races. Driver load balancing, using the non-occupancy time score in the cost evaluation operation, helps to avoid driver fatigue and thus improve safety. At step 1005, a home return score is calculated. If the status of a driver is 5 'return home', a score is then calculated. If the driver has any other status, the return home score is then zero. If the driver's status is 'return home', the home return score is calculated as the product of -1 and the number of miles saved and a distance criterion. The component of the miles saved on the score gives a measure of the reconciliation at home that the driver would benefit from if he fulfilled the request. The component of the miles saved is calculated as the current distance to the home (which is the road distance between the current position of the vehicle and the driver's home address) minus the distance between the home position and the home (which is the road distance between the deposit position of the reservation and the address of the driver's home). The distance criterion provides weighting and can be set by a system administrator 100. The inclusion of the home return score has the effect of increasing the probability of a race being allocated to a driver returning home. (eg for lunch or at the end of the shift) if the race will take the driver to a position that brings him closer to home. The size of the score depends on the distance that would be saved, so that a score is obtained if the deposit position is relatively closer to the address of the driver's home.
[0057] In step 1006, a 5/10 deposition score is calculated. For vehicles with '5' or '10' deposit status, the 5/10 deposit score has a positive value. For vehicles that do not have such status, ie for drivers who are free and have not been allocated to a reservation, the score 5/10 is zero. The status of the vehicle is adjusted by the driver by means of his driver device 110. In particular, when the driver device 110 calculates that there is less than 10 minutes of travel to the deposit address, the device driver 110 gives the driver 3033066 -41- option to adopt the status 'deposit in 10'. If the driver chooses this option on the driver device 110 (when the vehicle is stationary), the status 'deposit in 10' is activated. Likewise, when the driver device 110 detects that there is less than five minutes of travel to the deposition position, the driver device 110 provides the driver with the option of selecting the deposition status of the driver. . If the driver of the vehicle has a status 'deposit in 5', a score of 20 points is calculated. If the driver has the status 'deposit in 10', a score of 30 points is calculated.
[0058] The calculation of a 5/10 deposit score makes it possible to consider the allocation of vehicles which have PAB status (that is, have a running race) to a reservation. However, a penalty is applied to them that they are less favored than vehicles that are currently empty. This provides protection against the late arrival of the vehicle for the reservation if it incurs an unforeseen delay in the previous trip.
[0059] In step 1007, a hotspot attraction score is calculated. This is described in more detail below. In a nutshell, the inclusion of the hot spot attraction score gives rise to the organic attraction of vehicles to sensitive points to better serve customers and better manage the fleet of vehicles.
[0060] In step 1008, the scores calculated in steps 1002 to 1007 are summed to obtain a total score of the driver / vehicle / reservation combination. This score is then used in an allocation process which is now described with reference to FIG. 11. The allocation process of FIG. 11 is executed by the race allocation module 105. With respect to FIG. the process begins at step 1101. At step 1102, a reservation is made and entered into the system. This corresponds to step 902 of FIG. 9. In step 1103, the allowance module 105 waits until X minutes before the collection time of the reservation. The allocation process is started at a predetermined time before the collection time (at the correct date). For example, the value of X may be 20, in which case the allocation process begins 20 minutes before the scheduled collection time. In step 1104, the race allocation module 45 selects the Y vehicles that are closest to the collection position of the reservation. The value of Y may be, for example, 20 or 30. The nearest determined vehicles are those with the shortest distance between their current position (which is their last reported position) and the position of the collection. The distance is calculated as the straight-line distance between the latitude and longitude coordinates of the vehicle position and the position corresponding to the collection address. The use of the bird's-eye distances at step 1104 makes it possible to select an appropriate number of vehicles that can be allocated to the race but without the treatment required to calculate the routes and the road and road distances for each of the vehicles. At step 1104, only vehicles with available status, return home, deposit in 5 or deposit in 10 can be selected. The result is a fleet of candidate vehicles for the reservation.
[0061] In step 1105, a score is calculated for the vehicle / reservation combination for each of the vehicles that were selected at step 1104. The score is calculated as described above with reference to FIG. result a numerical value that indicates the adequacy of the vehicle for the reservation.
[0062] In step 1106, the race allowance module 105 determines whether or not a vehicle is to be allocated to the reservation. This implies that there is a vehicle that is by far best suited for the reservation or that there is only one vehicle (or a small number of vehicles, eg 2 or 3 vehicles) that would be able to reach the collection position at the collection time or before the collection time. Step 1106 can be implemented in a variety of ways, two of which are presented here. According to a first option, the scores of the vehicles calculated in step 1105 are compared. In the notation adopted, a lower numerical value indicates a better match for the reservation. Thus, the vehicle with the lowest score is the one that best suits the booking. If at step 1106 it is determined that the vehicle with the lowest score has a score that is much lower than the second lowest score, it can be determined that the vehicle with the lowest score is sufficiently well adapted to the reservation and must be allocated to it. Alternatively, it is determined that the vehicle must be allocated to the reservation if the remaining time to the collection time is equal to or less than a limit amount added to the expected journey time from the vehicle with the lowest score to the collection address. This threshold provides a buffer. The limit quantity can be two minutes for example. This advantageously makes it possible to determine that it is sufficient to allocate a vehicle on time (or possibly shortly before the hour) at which the vehicle should leave its current position to arrive at the collection position in time to collect at time the customer. Making this determination on the basis of the vehicle with the lowest score makes it possible to allocate the vehicle that is best suited to the reservation even if it is not the vehicle closest to the position of the vehicle. collection or having the shortest journey to the collection position. At step 1107, it is determined that at step 1106 it has been determined that a vehicle must be allocated or not. If a vehicle is to be allocated, the vehicle with the lowest score is allocated to the reservation at step 1112 before the process ends at step 1113. If it is not determined that the vehicle must be allocated , which occurs when there is no significantly better vehicle for the reservation and when more than 30 vehicles could reach the pick up position in time to satisfy the reservation, the process proceeds to step 1108. 3033066 - 44 - Configuration of the race allocation module 105 to allocate a vehicle to the reservation at the last minute, or 'just in time', unless there is a significantly better vehicle, increases the flexibility of the resource allocation of vehicles of a fleet. It also contributes to reducing the total number of miles traveled by the fleet's 5 vehicles in order to satisfy the reservations that are received by the system 100. An optional step 1108 follows step 1107. It is determined that the number of vehicles constituting acceptable candidates for the allocation to the reservation is sufficient or not. In particular, step 1108 involves determining that the number of vehicles having a score lower than a limit value (in this example the limit value is 100) exceeds or not a limit number of vehicles (eg 5 vehicles). If the number of vehicles is insufficient, at step 1109 the vehicle search is expanded to include other vehicles in the candidate vehicle fleet for the reservation. These other vehicles are added to the vehicles identified at step 1104, and these other vehicles are noted at step 1105 at the next execution of this step. After step 1109 or after step 1108 revealing that the number of vehicles is sufficient, in step 1110 the race allocation module 105 waits until X-1 20 minutes before the collection time. Once this time is reached, the value of X is decremented in step 1111 and the process returns to step 1105, where a new score is calculated for each vehicle in the candidate fleet. The effect of steps 1110 and 1111 is that the scores are calculated for vehicles in the candidate fleet once a minute until a vehicle is allocated to the reservation. At the next execution of step 1105 with respect to a given reservation, it is possible that a different result is obtained. In particular, the status and positions of the vehicles in the fleet of candidate vehicles may have changed so that there is now a significantly better candidate vehicle that can be allocated to the reservation, or that the candidate with the lowest score must be allocated now to be able to arrive in time at the collection position (because the journey time from the current position of the highest rated vehicle to the collection position is the same as or slightly longer than the remaining time until 'at the time of collection). At the next execution of step 1105, vehicles that no longer have any of the proper statuses (available, deposit in 5 or deposit in 10) are eliminated from the candidate vehicle fleet and are not rated. The size of the candidate vehicle fleet is therefore generally reduced to the following executions of step 1105. If the number of potentially suitable vehicles falls too low, the search for vehicles is enlarged and the number of candidate vehicles increased under steps 1108. and 1109.
[0063] From the foregoing it will be deduced that steps 1105 and 1106 are repeated until a vehicle is allocated for reservation. The number of repetitions of these steps depends on the initial value of X, which dictates how long before the collection time the allocation process should begin, and how many minutes before the collection time the vehicle is allocated to the reservation. For reservations with city center locations with a relatively large number of vehicles, vehicles may be allocated only a few minutes, for example 2, 3 or 4 minutes, before collection times. For bookings at more distant positions, where there are relatively few vehicles and low vehicle density, vehicles can be allocated considerably more time before the collection time, for example 12, 15 or 18 minutes before the time of collection. collection time. For fleets of relatively low density vehicles, given the geographic area covered, a higher value of X may be appropriate.
[0064] Advantageously, a system administrator can set the value of X which indicates how many minutes before the collection time the allocation process begins. Similarly, a system administrator 100 can set the value of Y that determines the number of vehicles to be selected in the fleet at step 30 11o4. The management of hot spots and the allocation of vehicles when hot spots are used will now be described. A hot spot may be created automatically by the central system 101 after triggering conditions have been detected. Such a sensitive point can be called a charged area sensitive point or dynamic point sensitive. Alternatively a hotspot may be created by an administrator or controller of the system so as to be active at a predetermined time in the future. Such a hot spot may be configured to become active several times in the future, for example at regular intervals. Such a sensitive point may be called a programmed trouble spot. Finally, a hotspot can be created manually by a system administrator 100 or a system controller for immediate application. A hot spot is defined by hot spot definition information as follows. The hot spot definition information includes a definition of a hot spot region. The hotspot region is the region to which the vehicles are to be attracted and which typically coincides with the region experiencing, or about to experience, a particularly large number of requested bookings collections in a given period of time. The hotspot region may be defined in terms of one or more predefined areas of the region covered by the system operator 100. The zones may be identified by a zone number or other alphanumeric identifier for example, and may by example 25 correspond to regions of postal codes or other administrative districts. The hotspot region may alternatively be defined by a distance and a central position which together define a circular hotspot region. The hot spot definition information includes an attraction distance of sensitive point. This defines a distance on which vehicles are attracted to the hotspot. In certain embodiments relating to programmed hot spots, it defines a distance on which the vehicles are rated less 3033066 -47- (in other words a penalty score is applied to them) for reservations having collection positions that are not not find in the sore spot. In some embodiments relating to charged region hot spots, if the reservation deposition positions are below this distance, an increase in the score of certain vehicles is then applied. The hotspot definition information may also include a hotspot central position. This position is used to calculate that a vehicle or deposit position is below the hot spot attraction distance of the hot spot. If the hotspot region is defined by a distance and a central position, it may be the same as the central position of the hotspot. Rather than using the hot spot definition information having a central hot spot location, the hot spot region delineation can be used to calculate that a vehicle or depot position is below the distance 15 of sensitive point attraction of the sensitive point. Hotspot definition information may also include a bonus parametric value. This parametric value refers to the unit of attraction of the vehicles towards the sensitive point. The parametric bonus value may be a unit of distance parameter in that the amount of attraction (or repulsion) depends on a distance between the position of the vehicle or deposit and the hotspot. Here the parametric bonus value can be called the parametric bonus value per mile. The bonus parameter is a weighting parameter.
[0065] The hot spot definition information may further include one or more types of vehicles. This indicates the types of vehicles to attract to the hotspot. If no vehicle type is specified in the hot spot definition information, then all vehicle types are attracted to the hot spot. The dynamic hot spots (which are described below) have the advantage that they do not specify any particular type of vehicle. The programmed hot spots (which are described below) can specify types of VIP or green vehicles (electric vehicles or hybrid vehicles) for example. 3033066 - 48 - If the hot spot is a programmed hot spot, the hot spot definition information then includes start and end times as well as operational days of the week or other periodicity information (eg the first 5 Monday of each month). Each hot spot also includes an identifier or name that is unique within the system 10 or central system 101 for identifying the hot spot and for differentiating it from other hot spots that are stored in the system 10 or the central system 101. system 10 and / or the central system 101 may provide a user interface to allow an administrator or other operator to define the hot spots. The user interface includes means for the administrator / operator to enter the hotspot definition information described above. The central system may include default values for some of the hot spot definition information that is stored as part of the hot spot definition unless the default value is changed by the administrator / operator. For example, the central system 101 may include default values for the hotspot attraction distance (3 miles / 5 km was judged a suitable default value) and / or the bonus parameter value per mile (0). , 8 was considered a suitable default value). The user interface allows the administrator or other operator to program the future occurrences of the hot spots and this possibly at regular intervals. For example, a hot spot can be scheduled to occur each weekday in the area that covers a city's financial district, refer to VIP-type vehicles, and be active from 4pm to 6pm. VIP vehicles will then be lured to the financial district at times when these VIP vehicles are in high demand by the top 30 executives wishing to drive to the airport, train station, or return home. For example, a hot spot can be scheduled to occur each weekday in the area that covers the legal district of a city, refer to any type of vehicle and be active from 10am to 22:30. Vehicles will then be attracted to the legal district at times of high demand for vehicles, this request being caused by the fact that at 22h law firms allow their employees to return home by rental vehicle with driver on account that holds the cabinet 5 with the operator of the system 100. The system 10 and / or the central system 101 can be configured to control the positions of the vehicles, the statuses of the vehicles (available, PAB, allocated, etc.), the reservations have been made but no vehicles have yet been allocated, and 10 reservations that a vehicle has been allocated but have not yet started (ie the customer has not yet been collected at the collection position specified in the reservation). Controlled reservation information includes collection locations and departure times. Based on the monitored information, the central system 101 is configured to detect abnormally high demand in a region or a particularly large imbalance between supply and demand (for example compared to an average throughout the fleet) and automatically establishes sensitive points following this detection. Regions where an abnormally high demand or a particularly large imbalance is detected are called 'charged regions'. A hotspot automatically created in response to the detection of a loaded region may be called a 'dynamic hotspot'. An abnormally high demand in a region (eg a zone) may for example be determined when it is detected that the number of reservations having collection positions in the region for a certain period (eg 30 minutes) exceeds one average for the region by a limit quantity. The average can relate to a particular time of the day and a particular day of the week, thereby activating hot spots only when reservations for the area are abnormally numerous given the usual conditions at that particular time. The limit may be an absolute amount above average or a multiple of the average. For example, the limit can be 1.8 times the average number of bookings. It can alternatively be set to 88 bookings in a period of 30 minutes on the basis of an average of 54 bookings in 30 minutes. 3033066 -50- An imbalance of supply and demand can be determined in comparison to supply and demand across the fleet or in a wider area (eg the central area or the west area of London ). The supply and demand levels can be based for example on the number of vehicles having an appropriate status, for example 'available', 'deposit in 5' or 'deposit in 10', in the zone or in a adjacent area relative to the number of reservations recorded in a period of 30 minutes. An imbalance can be determined with reference to a threshold. The threshold can be defined as an absolute value or as a proportion of the relevant metric. For example, the threshold can be defined as a ratio of 1: 2 (# relevant status: # reservations) or can be defined as (# reservations - # relevant status) + 30 vehicles, where # reservations refers to the number of reservations and #state relevant is the number of vehicles with appropriate status.
[0066] Since the system 10 and / or the central system 101 may be able to receive advance bookings, it is possible to have an idea of the probable number of reservations in advance, although a certain proportion of bookings are usually made at the last minute. This allows the system 10 and / or the central system 101 to determine in advance an abnormally high demand and thus to establish charged region (dynamic) sensing points in anticipation of the demand or at least in anticipation of the peak of Requirement. The automatic establishment of hot spots by the central system 101 following the automatic detection of a hot spot need involves the provision by the central system 101 of the various parameters necessary for the hot spot definition information. The hotspot definition information includes a definition of a hotspot region, namely the region where unusually high reservation collections have been detected. Typically the region is an area. The central position of a hotspot is typically the center of the area. The attraction distance of the hot spot may be a default value (eg 3 miles or 5 kilometers) or may depend on the determined demand, eg. ex. a larger demand or an imbalance of supply and demand equates to a greater distance of attraction of sensitive point. A programmed hotspot has a hotspot attraction distance that is predetermined before the hotspot becomes active, and is stored as hotspot definition information. A dynamic hot spot can become active first with a default value as the hot spot attraction distance and can change depending on the demand.
[0067] 10 The bonus parametric value may have a default value. Alternatively, the bonus parametric value may depend on the determined demand, e.g. ex. higher demand or imbalance of supply and demand equals higher parametric bonus value. A programmed hotspot has a bonus parameter that is predetermined before the hotspot becomes active, and is stored as hotspot definition information. A dynamic hot spot can become active first with a default value as a bonus parameter and can change if more loaded regions become active.
[0068] If the hot spot to be processed is a programmed hot spot, the hot spot definition information then includes start and end times with the values that the central system 101 will have judged appropriate given the reservation profile with the hot spot locations. collection in the hot spot area.
[0069] Each hot spot also includes an identifier or name that is unique within the system 10 and / or the central system 101 to identify the hot spot and to differentiate it from other hot spots that are stored in the system 10 (e.g. in the priority position database 16) and / or in the central system 101. When the hot spot processing has ended, the name of the hot spot can be recirculated and subsequently assigned to another hot spot. As mentioned above, when a hot spot is in place, the allocation of vehicles to reservations takes into account the hotspot in the vehicle rating so as to attract vehicles to the hotspot for they collect the customers reserved for the addresses in the hot spot. This takes place in a slightly different way for the different types of hot spots. In a few words, in some embodiments this is achieved by penalizing (reducing the score) vehicles that are relatively close to the sore spot for reservations that have collection positions outside the hotspot. This increases the likelihood that the reservation will be allocated to a vehicle that is not near the hotspot, thereby allowing vehicles near the hotspot to be allocated to reservations having collection locations located in the hotspot. For reservations with collection points in the hot spot, no adjustment of the scores of a vehicle taking into account the sore point is applied. This makes it possible to satisfy the reservations having collection positions in the hot spot with the naturally most suitable vehicle for booking, according to the scoring and allocation processes described above. This technique is particularly suitable for sensitive points that do not relate specifically to one or more types of vehicles, although it provides the desired attraction of the vehicles also when the sore spot specifically relates to one or more types of vehicles. In some other embodiments, for sensitive points that relate specifically to one or more types of vehicles, vehicles of a type consistent with the hot spot definition information are best scored (receive a negative penalty score this which improves their score) for reservations which both have a deposit position relatively close to the sore point or within the sore point and specify a vehicle of a different (but consistent) type. For example, if the hot spot relates to VIP vehicles, VIP vehicles are best rated for regular 4-seater (non-VIP) vehicle reservations if the deposit position is in the sore spot or near this one. This helps to bring vehicles of the desired type to the vicinity of the hotspot but without forcing them to travel empty (without passengers) over the entire distance. In addition, once a hot spot has been established and activated, the driver devices associated with the vehicles that are relatively close to the loaded region and / or the corresponding hot spot can receive a message from the device server. of driver 107 informing drivers of vehicles in the loaded region / sore spot. This is particularly true of dynamic hot spots but is also applicable to programmed hot spots. The driver devices may be selected to receive the message, for example if they are below the sensing point attraction distance from the center of the sensing point or if they are within a multiple ( eg 1.5) of the hot spot attraction distance from the center of the hot spot. The message may indicate, for example, that a charged region exists or a hot spot is active, and indicate the zone (s) that form the hot spot region. Although the programmed hot spots may not be announced to the drivers, if they are, the message may then indicate a start time and / or end time of the hot spot. On receipt of such a message, drivers may choose to go to the hot spot if their status is 'available', in order to have a better chance of being allocated to a reservation having a collection position at the same time. inside the sore spot. This helps to better serve customers and increase overall fleet utilization. However, because of logging and allocation, vehicles are migrated to the hotspot even without this message being sent. The calculation of the hotspot penalty score in step 1008 of Figure 10 can be performed in a variety of ways.
[0070] A first option is described below, relating to dynamic hot spots. If the hot spot definition information specifies one or more vehicle types, the hot spot attraction score is calculated only for vehicles of one of the specified types. If the hot spot definition information 30 does not specify any type of vehicle, or specifies all types, the hot spot attraction score is calculated for all vehicles regardless of their type. This is accomplished by adjusting the zero point attraction score if the sensitive point information specifies one or more types of vehicles and the vehicle type of the noted vehicle is not consistent with the type (s). specified in the hotspot information.
[0071] 5 The hotspot attraction score is calculated using the formula: score = (max distance - distance to hotspot) * bonus value where: 'bonus value' is the parametric bonus value, 'distance up' at sensitive point 10 is the distance between the vehicle position and the hotspot, and 'max distance' is the hotspot attraction distance. The vehicle position is the current position of the vehicle if the status of the vehicle is' available 'and is the deposit position of a reservation presently satisfied if the vehicle status is' AB', 'deposit in 5' or ' deposit in 10 '.
[0072] The hotspot attraction score is set to zero if the distance between the vehicle position and the center of the hotspot is greater than the hotspot attraction distance. In this way, only the vehicles which are below the sensitive point attraction distance of the sensitive point can have a sensitive point attraction score. The parametric value of the bonus is a weighting of the hot spot component with respect to other components of a vehicle's score for a reservation.
[0073] The hotspot attraction score is calculated only for reservations for which the collection location is not in a hotspot. It is apparent from the calculation of the hotspot attraction score shown above that the hotspot attraction score is greater for the higher sensitive point attraction distances. This implies that an upper hovering attraction distance will be used to attract vehicles from a wider area and will also serve to further attract vehicles at a given distance from the center of the hotspot. It should also be noted that the hotspot attraction score is higher for the vehicles that are closer to the center of the hotspot. This helps to attract more vehicles to the hotspot if they are already relatively close and helps to reduce the overall distance traveled by the fleet to satisfy reservations. A reduced distance traveled means a decrease in fuel consumption, vehicle wear, risk of accidents, driver fatigue, 10 and generally a reduction in costs. The following example may help to understand the effect of the first option for calculating the hotspot attraction score on vehicle allocation. In this example, a hot spot is active in a first zone. A reservation has a collection position in a second zone, adjacent to the first zone, and a departure time that occurs while the hot spot is active. A vehicle with an 'available' status (for example it may have acquired this status only after depositing a customer from a previous reservation) is located very close to the collection position of the reservation. Normally the vehicle would be noted for booking and the booking would probably be allocated to that vehicle. However, a hotspot attraction score is included in the vehicle cost notation because the vehicle is close to the hotspot, and this score is a penalty score for the reservation that is outside the hotspot. This hotspot attraction score means that the vehicle is rated worse for booking. The same is true for other 'available' vehicles near the hotspot. As a result, vehicles that are close to Zone 2 but not Zone 1 will most likely be allocated to the reservation, even if they are further away than the vehicle that is very close to the collection location of the reservation. This has two effects. First, a vehicle at a position remote from the hotspot is attracted to a position relatively close to the hotspot to satisfy the reservation. Second, the vehicle that is near the collection location of the reservation can be allocated to a reservation having a collection position in the hot spot. Since the sensitive point has been activated due to an abnormally high demand in the hotspot region, the vehicle will typically be allocated to a reservation having a collection position in the hotspot.
[0074] This example also helps to understand how the inclusion of the hot spot attraction distance in the hot spot attraction score causes the vehicles to be attracted to the hot spot for a greater distance. In particular, a skew point distance which covers not only the second zone but also the next outer zone (deviating from the first zone) would increase the chances that a vehicle further away from the sore point would be allocated to the booking. However, as the score depends on the distance of the vehicle from the sore point, vehicles that are far from the sore point by a distance just below the skew point pulling distance would have a low penalty score and will be less likely to be allocated to the reservation.
[0075] In calculating the vehicle distance to the center of the hotspot, the direct distance (as the crow flies) is used. To determine the distance as the crow flies, the distance between their current position (ie their last reported position, as described above vehicle positions are usually reported every 20 seconds) and the position of the center of the vehicle. sensitive point is calculated. This distance is calculated as the straight-line distance between the latitude and longitude coordinates of the vehicle position and the latitude and longitude coordinates of the position corresponding to the center of the hot spot. The calculation of distances as the crow flies requires relatively little computing resources. Alternatively, a road distance can be calculated and used instead of the bird's eye distance, but it uses more computing resources. When the hot spot definition information specifies one or more types of vehicles (eg the VIP vehicle type or the green vehicle type), such vehicles are not allocated to certain reservations when the vehicle is traveling. found below the sensitive point attraction distance. The valid reservations in this case are reservations which do not require this type of vehicle in the sensitive point definition information and whose deposit position is relatively distant from the sensitive point, for example because the position of The deposit is further away from the center of the sore point than the current position of the vehicle or because the deposition position is located further than a limiting distance from the center of the sore point. This can be achieved by adding a high penalty score when scoring the vehicle for bookings that do not specify the vehicle type, scoring taking into account the deposit position and skew position information. This function helps to prevent vehicles of the type required in the hot spot definition information from leaving the vicinity of the hot spot, unless a reservation of the type for which the hot spot 10 has been created forces them to leave the hot spot. neighborhood. In the case where a vehicle is within the sensitive point pulling distance of two distinct sensitive points, the vehicle score may include two distinct hotspot attraction scores (one for each hotspot) or may include a hotspot attraction score which is a function of the two scores. For example, it may include a hotspot attraction score which is the larger of the two scores or which is the average of the two scores. A second option will now be described. It relates to the hot spots 20 whose hot spot definition information specifies one or more types of vehicles, and which are typically programmed hot spots but which may be dynamic hot spots or hot spots manually created for its immediate application.
[0076] The hot spot attraction score is calculated only for vehicles of one of the types specified in the hot spot definition information. The hotspot attraction score is calculated according to the formula: 30 score = (max distance - distance to the hotspot) * bonus value 3033066 - 58 - where: 'bonus value' is the parametric value of the bonus, 'distance to sensitive point' is the distance between the sensitive point and the position of the reservation, and 'max distance' is the sensitive point attraction distance.
[0077] The hotspot attraction score is set to zero if the distance between the reservation deposition position and the center of the hotspot is greater than the hotspot attraction distance. In this way, only reservations whose deposition position is below the skew point attraction distance of the hotspot can provide a hotspot attraction score for vehicles of the desired vehicle type. In addition, the hot spot score is set to zero if the estimated deposit time of the reservation is outside of the hot spot activity period. The hotspot attraction score is calculated for the vehicles at a predetermined time (e.g. sixty minutes) before the start of the hotspot activity period. The relevant vehicles thus begin their journey to the hotspot before the hotspot becomes active. This also avoids attracting vehicles to the hotspot if they arrive after the hotspot becomes inactive.
[0078] The parametric value of the bonus is a weighting of the hot spot component with respect to other components of a vehicle's score for a reservation. The bonus score is negative, producing a negative hot spot attraction score for the relevant vehicles. Since lower scores are better, using a negative skew attraction score produces a better score for the 25 relevant vehicles. In embodiments in which a higher score is better, the hotspot attraction score is positive to improve the rating of the relevant vehicles. The hotspot attraction score is only calculated regardless of the collection position for the reservation. As part of the allocation process in Figure 11, only Y vehicles are noted for booking. Usually, only a portion of these vehicles are of a type specified for the hotspot. When a sensitive point specifying a vehicle type is active, the vehicle resource allocation module 15 and / or the race allowance module 105 can identify other vehicles of the correct type of vehicle that are located. find in the collection position or relatively close to it to note them for the reservation. This may be the case if the number of vehicles that are of the correct type for the hotspot drops below a threshold. It is apparent from the calculation of the hotspot attraction score shown above that the hotspot attraction score is greater for the higher sensitive point attraction distances. This implies that a greater hotspot attraction distance will be used to attract vehicles from a wider area and will also serve to further attract vehicles at a given distance from the center of the hotspot.
[0079] It should also be noted that the hotspot attraction score is higher for vehicles that are closer to the center of the hotspot. This helps to attract more vehicles to the hotspot if they are already relatively close and helps to reduce the overall distance traveled by the fleet to satisfy reservations. A reduced distance traveled means a decrease in fuel consumption, vehicle wear, risk of accidents, driver fatigue, and generally a reduction in costs. The following example may help to understand the effect of the second hot spot attraction calculation option on vehicle allocation.
[0080] In this example, a hotspot for VIP type vehicles is active or is programmed to become active in a first area. A reservation of a standard 4-seater vehicle has a collection position anywhere, near or far from the first zone. The depositing position of the reservation is close to the hot spot, for example in a second zone adjacent to the first zone. The start time of the reservation is subsequent to the pre-determined period (eg 60 minutes) of entry into activity of the hot spot, or occurs during the period of activity of the hot spot. A VIP vehicle at 3033066 - 60 - 'available' status (for example it may have acquired this status only recently after depositing a customer from a previous reservation) is at a distance (eg 2 miles / 3 kilometers) from the collection position of the reservation. Normally the vehicle would not be particularly well rated for the reservation due to its distance from the collection location and the inappropriate vehicle type and it would probably not be allocated to the reservation. However, a hotspot attraction score is included in the vehicle cost notation because the vehicle is of the type specified in the hotspot definition information and the deposition position is below the attraction distance of the vehicle. sensitive point of the sore point, and this score is a bonus score (a negative penalty score) for the reservation. This hotspot attraction score means that the VIP vehicle is rated better for booking. It is the same for other VIP vehicles that are in the vicinity of the collection position of the reservation. As a result, one of the VIP vehicles that is noted for the reservation will be more likely to be allocated to the reservation, even if it is farther from the collection position than vehicles of other types and possibly rated with respect to other aspects of the scoring process in Figure 3. This has the effect of attracting a VIP vehicle to a position that is relatively close to the hot spot. In addition, this is done without requiring the VIP vehicle to travel empty; instead he travels while he is satisfying a customer reservation. Once the VIP vehicle drops the customer to the stow position, the vehicle is found near the hotspot and can more easily and efficiently meet a reservation having a pick up position in the hotspot and requesting the type of VIP vehicle. Thus, the distance traveled by the VIP vehicle without a customer on board is reduced. In addition, the availability of VIP 25 cars in the hot spot is enhanced, allowing the fleet to better respond to customers' vehicle type preferences while satisfying reservations. The VIP vehicle begins to be considered for bookings that have collection positions in the hot spot once the VIP vehicle has the PAB status for its previous reservation, ie. the reservation that attracts the vehicle to the hotspot.
[0081] This example also helps to understand how the inclusion of the hot spot attraction distance in the hot spot attraction score causes more vehicles of the desired vehicle type to be attracted to the point of attraction. sensitive. In particular, a hot spot attraction distance that covers not only the second zone but also the next outer zone (deviating from the first zone) would increase the chances that a reservation of a vehicle of a different type would be 5 used to bring a vehicle of the desired type to a position near the hotspot. However, since the hotspot attraction score depends on the deposition distance of the hotspot, for reservations having deposition positions remote from the hotspot by a distance just below the hotspot attraction distance, Vehicles of the desired type would have a low bonus score and would have 10 less chance of being allocated to the booking. In calculating the distance from the deposit position of the reservation to the center of the hotspot, the direct distance (as the crow flies) is used. This distance is calculated as the straight-line distance between the latitude and longitude coordinates of the vehicle position and the latitude and longitude coordinates of the position corresponding to the center of the hotspot. The calculation of distances as the crow flies requires relatively little computing resources. Alternatively, a road distance can be calculated and used instead of the bird's-eye distance, but it uses more computing resources.
[0082] Each programmed hot spot may include a setting that imposes a ceiling on the number of vehicles having non-zero hot spot scores per unit of time that is allocated to the reservations. For example, the setting may cap the number of vehicles at 20 or 30 per hour. This helps to prevent an excess of resources at the same position. If the deposit position of a reservation is below the hot spot attraction distance of two distinct hot spots, the vehicle score may include two distinct hot spot attraction scores (one for each hot spot ) or may include a hotspot attraction score which is a function of the two scores. For example, it may include a hotspot attraction score which is the larger of the two scores or which is the average of the two scores. Instead of the database functions being performed by a small number of databases, in the above embodiments the operational database 130 and the network database drivers 131, as well as Based on historical data 132, the functions can be distributed among a larger number of databases, as shown in system 100 of Figure 8b. The same reference numbers as those in Figure 8a are retained for similar items that will not be described again to avoid repetition.
[0083] In Figure 8b, an account database 119 is configured to store the data of each account held with the system operator 100. The record keeping function is provided primarily by a database of the journeys made. 108 and a map and position database 109, as well as other system components 100. Each vehicle is respectively recorded in a vehicle database 121. Each driver is included in a database. The collection and deposit addresses are selected from one of the plurality of addresses stored in an address database 115. Once a race has been allocated to a particular driver and a particular vehicle, it is recorded in the database of the journeys 108 made with an indication that the journey has not yet been made. The central system 101, the reservations web server 102, the reservation application server 103, the race allocation module 105, the driver position control module 106 and the server of the driver devices 107 may be 25. implemented by the same server or by a server system working in cooperation, for example arranged in a cluster. Each of the central system 101, reservations web server 102, reservation application server 103, routing allocation module 105, driver position control module 106 and driver server 107 includes dedicated software modules specific to this component. If multiple servers are used, each component may include a respective server (or more than one server) or some components may share a server or server system. In some embodiments, the vehicle resources are autonomous vehicles, also referred to as self-driving vehicles or self-driving cars. When the system 100 includes autonomous vehicles, each driver device 110 is replaced by an onboard control system, which may be called an autonomous mode controller. The autonomous mode controller controls the speed and direction of the autonomous vehicle and maintains an accurate record of the position and orientation of the autonomous vehicle (unmanned). Autonomous driving sensors may include any number of devices configured to generate signals that assist in maneuvering the vehicle when operating autonomously (without a driver). The autonomous vehicle may include a number of cameras and other sensors, including UDAR and / or radar sensors, which pass the vehicle environment information to the autonomous mode controller. This information includes the position, constitution, orientation and speed of nearby objects, including other vehicles. Autonomous driving sensors help the vehicle "see" the road and its surroundings and / or negotiate various obstacles when operating in stand-alone mode. The autonomous mode controller may communicate with the central system 101 via the radio network 111 according to any suitable protocol.
[0084] The autonomous mode controller may be configured to control one or more subsystems when the vehicle is operating in autonomous mode. Examples of subsystems that may be controlled by the autonomous mode controller may be a braking subsystem, a suspension subsystem, a steering subsystem, and a transmission subsystem. The autonomous mode controller can control any one or more of these subsystems by sending signals to control units associated with these subsystems. The autonomous mode controller can control the subsystems based, at least in part, on signals generated by the autonomous driving sensors.
[0085] As an element of the autonomous mode controller, autonomous vehicles may be provided with an on-board route planning module. When the autonomous vehicle receives information representing start and end positions of a road, the on-board route planning module requests the map and position database 109 and possibly traffic data in the historical database 132 and / or instantaneous traffic information to calculate the best route. The autonomous vehicle may also receive information representing one or more waypoints to which it must travel between the starting and ending positions, or a number of waypoints or positions to which it can travel in any order. The route planning module can then calculate the most efficient route to travel to each of the positions. Alternatively, the autonomous vehicle may not have an on-board route planning module but instead receive route information, i.e. information specifying one or more routes, or navigation instructions sent by the central system 101. The autonomous mode controller of each autonomous vehicle may also be preprogrammed to cause the autonomous vehicle to get to a particular position and wait for it. when the vehicle has no starting and finishing positions or particular waypoints to go to. Alternatively, when the autonomous vehicle does not undertake a specific path (ie when it is inactive), the autonomous mode controller can cause the autonomous vehicle to remain on one of a number of circuits. or predetermined routes. The particular predetermined circuit or route chosen by the autonomous mode controller may depend on the position of the vehicle when it becomes inactive. Regardless of the number of servers in the system 100, each server preferably has a number of features which will now be described with reference to Figure 12. Figure 12 shows a single server 40. If the system 10 and / or 30 the system 100 comprises several servers, multiple versions of the server 40 can be connected together. Each server 40 in the system 100 comprises a processor 1212. The processor 1212 is connected to a volatile memory such as a RAM RAM 1213 by a bus 1218. The bus 1218 also connects the processor 112 and the RAM 1213. to a non-volatile memory, such as a ROM 1214. A communications interface 1215 is coupled to the bus 1218, and therefore also to the processor 1212 and the memories 1213, 1214. The interface 1215 is connected to a communications network (eg a radio network) in any convenient way, for example via the Internet or a local network. Within the ROM 1214 is stored a software application 1217 which includes program code which causes the server to perform the functions it deserves. An operating system (OS) 1220 is also stored in the ROM 1214. A rendering device such as a display 1219 may be provided with the server 40. An input device such as a keyboard 1221 may be provided with the server 40. The 15 administrators and other users can thus perform configuration, control and updating operations as appropriate. The server 40 can take any form. In general terms, the server 40 includes processing circuits 1212, having one or more processors, and a storage device 1214, 1213, including one or more memory units. The storage device 1214, 1213 stores computer program instructions which, when loaded into the processing circuits 1212, control the operation of the server 40.
[0086] The term "memory" used in this specification relates primarily to a memory comprising both non-volatile memory and volatile memory unless otherwise indicated in the context, although the term may also cover one or more volatile memories only, a or several non-volatile memories only, or one or more volatile memories and one or more non-volatile memories. RAM, DRAM, SDRAM, etc. are examples of volatile memory. ROM, PROM, EEPROM, Flash memory, optical memory, magnetic memory, etc., are examples of nonvolatile memory. 3033066 - 66 - Any reference to a "computer-readable storage medium", "computer program product", "tangibly implemented computer program" etc., or to a "processor" or "processing circuit" "etc. It should be understood as encompassing not only computers with different architectures such as single-processor / multiprocessor architectures and serial / parallel architectures, but also specialized circuits such as FPGA FPGAs, chip-specific circuits, and more. ASIC application, signal processing devices and other devices. Any reference to programs, instructions, codes, etc. should be understood as referring to software of a programmable processor firmware such as the programmable content of a hardware device as processor instructions or configured parameters or configuration of a fixed function device, a arterial gate array, a programmable logic device, etc.
[0087] It will be realized that the above embodiments are not intended to be limiting and that other variations and modifications will be apparent to those skilled in the art and are intended to be encompassed by the claims unless expressly excluded. by the language of the claims in the consideration of equivalents.
[0088] Some of these other possibilities and modifications are now described below. Instead of calculating the hot spot attraction score for the hot spot attraction distance parameter, the score can be calculated without using this parameter. However, a hotspot attraction score can be calculated only for vehicles that are below the hotspot attraction distance of the hotspot. Instead of using a simple direct linear function for the hotspot attraction distance parameter, a more complex function of any suitable form can be employed. It is the same for the distance of the vehicle relative to the sensitive point. 3033066 -67- The bonus parameter can be omitted from the calculation of the hotspot attraction score. This avoids applying weightings to the sensitive points (at least without adjusting the sensitive point attraction distance parameter), but the resulting simplification may be sufficiently valid to justify the absence of this parameter. In the above, a low score indicates a better match to a reservation and the reservation is allocated to the vehicle with the lowest score. The scoring system can of course be configured in the opposite direction where a high score indicates a better match to a reservation. In this case, a skewed attraction penalty score is a negative score and a skewed attraction score is a positive score. In what has been explained above, the calculation of the ride cost is executed. at the time of a reservation and the result is returned to the customer requesting the reservation. The calculation of the cost may alternatively be made before the reservation (for example on the basis of an agreed rate), once the reservation has been satisfied, or later. In addition, the rating of a vehicle in terms of cost for a reservation can be made in any suitable manner. On the other hand, the cost rating can be run once and the best allocated vehicle can be allocated at that time, rather than performing the cost rating only when it is decided to allocate a vehicle. In addition, the disclosure of this application must be understood to include any unpublished features or any unpublished combination of features explicitly or implicitly disclosed herein or in any generalization thereof and during a prosecution of this application or any request derived from it, new claims may be formulated to cover such features and / or combination of such features. 30

权利要求:
Claims (61)
[0001]
REVENDICATIONS1. A network vehicle resource allocation system having controlled positions, the system comprising: a plurality of requesting devices; a plurality of vehicle resources, each vehicle resource having a respective controlled present position; and a vehicle resource allocation controller device comprising: a processor in communication with the plurality of requesting devices and the plurality of vehicle resources, and a computer readable medium in communication with the processor of the controller allocation device. vehicle resources, the computer-readable medium storing instructions which, at their execution by the processor, cause the processor to: store information relating to an active hot spot, the information identifying a region relating to the hot spot and information identifying a distance of attraction to the sensitive point; receiving, from a requesting device of the plurality of requesting devices, a request to send a vehicle resource to a requested position; automatically identify that the requested position is outside of the region identified as relating to the hot spot; for each vehicle resource of the plurality of vehicle resources capable of satisfying the demand, calculating a vehicle resource adequacy score to satisfy the demand, calculating a score comprising: calculating sub-scores for each of several factors and performing a mathematical operation on the sub-scores, for each of the vehicle resources that is capable of satisfying the demand, determining whether or not the vehicle resource is within the distance of sensing point attraction, and for each vehicle resource determined to be within the sensing point's attraction distance, calculating a touch point attraction penalty score and including the hotspot attraction penalty score in the mathematical operation to produce a score for the vehicle resource; and using the calculated scores for the plurality of vehicle resources to select a vehicle resource from the plurality of vehicle resources to be allocated on demand; and allocating the selected vehicle resource on demand.
[0002]
The system of claim 1, wherein determining whether or not the vehicle resource is within the sensing point's sensing distance comprises: receiving an indication of the current controlled position of the resource of the vehicle, and determining whether or not the vehicle resource is within the attraction distance of the hotspot based on the current controlled position of the vehicle resource.
[0003]
The system of claim 2, wherein receiving the indication of the current controlled position of the vehicle resource comprises: receiving the indication of the current controlled position from the vehicle resource.
[0004]
The system of claim 2, wherein receiving the indication of the current controlled position of the vehicle resource comprises: receiving the indication of the current controlled position from a positioning service in communication with the resource of vehicle. 3033066 -70-
[0005]
The system of any one of the preceding claims, wherein the request comprises a request for a first responder's vehicle.
[0006]
The system of any one of claims 1 to 4, wherein the request includes a customer reservation of a rental car with driver, and wherein the requested position is a collection position of the customer reservation.
[0007]
The system of any one of claims 1 to 4, wherein the request comprises a request to send a vehicle to a search position.
[0008]
8. System according to any one of claims 1 to 4, wherein the application comprises a request for autonomous vehicle. 15
[0009]
9. System according to any one of the preceding claims, the computer-readable medium furthermore memorizing instructions which, when executed by the processor, cause the processor to: automatically detect an abnormally high demand in a given region and in response to create automatically and activate a hot spot. 20
[0010]
A system as claimed in any one of the preceding claims, wherein calculating the hotspot attraction penalty score comprises: calculating a distance between the hotspot region and the position of the vehicle resource, a destination of a request satisfied by the vehicle resource; performing a mathematical operation on the calculated distance and the attraction distance; and using the result of the mathematical operation in the calculation of the skew attraction penalty score. 30
[0011]
A system according to any one of the preceding claims, wherein calculating the hotspot attraction penalty score comprises: calculating a distance between the hotspot region and the position of the hotspot vehicle resource, a destination of a request satisfied by the vehicle resource; subtraction of the calculated distance from the attraction distance; and the use of the result of the subtraction in the calculation of the hotspot attraction penalty score.
[0012]
The system of any preceding claim, wherein calculating the hotspot attraction penalty score comprises: calculating a distance between the hotspot region and the position of the vehicle resource a destination of a request satisfied by the vehicle resource; and using the calculated distance in the calculation of the skew attraction penalty score. 15
[0013]
A system according to any one of the preceding claims, wherein the calculation of the hot spot attraction penalty score comprises using the hot spot attraction distance in the calculation of the pull attraction penalty score. sensible point. 20
[0014]
A system according to any one of the preceding claims, wherein the calculation of the hot spot attraction penalty score comprises multiplying a value by a bonus parametric value, the bonus parameter value being part of the related information. at the sensitive point. 25
[0015]
A system according to any one of the preceding claims, the computer readable medium further storing instructions which, at their execution by the processor, cause the processor to: calculate a skew point penalty score and include the 30 hotspot attraction penalty score in the mathematical operation to produce a score only for vehicle resources that have a vehicle type consistent with a vehicle type specified in the hotspot information. 3033066 - 72 -
[0016]
A system as claimed in any one of the preceding claims, the computer readable medium further storing instructions which, when executed by the processor, causes the processor to determine whether or not the vehicle resource is located below the attraction distance of the hot spot by: calculating a direct distance between the hot spot and the position of the vehicle resource, or a destination of a request satisfied by the vehicle resource; and comparing the calculated distance to the attraction distance.
[0017]
A system as claimed in any one of the preceding claims, the computer readable medium further storing instructions which, at their execution by the processor, cause the processor to: calculate a direct distance between the vehicle resource and the relative position at the hotspot using latitude and longitude information of the vehicle position and the position of the hotspot.
[0018]
18. The system of any of the preceding claims, wherein the position of the hot spot is defined with reference to a center of the hot spot region.
[0019]
A system according to any one of the preceding claims, the computer readable medium further storing instructions which, at their execution by the processor, cause the processor to: provide a user interface enabling a user to specify identifying information the attraction distance to the sensitive point.
[0020]
A method of allocating resources of networked vehicles having controlled positions, the method comprising: storing, by a vehicle resource allocation controller, information relating to an active hot spot, the identifying information; A region relating to the hot spot and information identifying an attraction distance to the hot spot, wherein the vehicle resource allocation controller device is in communication with: a plurality of traffic control devices; an applicant, and a plurality of vehicle resources, each vehicle resource having a respective controlled present position; receiving, by the vehicle resource allocation controller device from a requesting device of the plurality of requesting devices, a request to send a vehicle resource to a requested position; automatically identifying, by the vehicle resource allocation controller, that the requested position is outside the region identified as relating to the hot spot; for each vehicle resource of the plurality of vehicle resources capable of meeting the demand, calculating, by the vehicle resource allocation controller device, a vehicle resource suitability score to satisfy the demand. , calculating a score comprising: calculating sub-scores for each of several factors and performing a mathematical operation on the sub-scores, for each of the resources of vehicles capable of satisfying the demand, the determination; whether or not the vehicle resource is within the sensing point's pulling distance, and for each vehicle resource determined to be within the sensing point's pulling distance, computing a penalty point attraction score 25 and the inclusion of the hotspot attraction penalty score in the mathematical operation to produce a score for the vehicle resource ; and utilizing, by the vehicle resource allocation controller device, scores calculated for the plurality of vehicle resources for selecting a vehicle resource from the plurality of vehicle resources to be allocated on demand; and allocating, by the vehicle resource allocation controller device, the selected on-demand vehicle resource.
[0021]
A network vehicle resource allocation apparatus having controlled positions, the apparatus comprising: a processor in communication with: a plurality of requesting devices, and a plurality of vehicle resources, each vehicle resource having a respective current controlled position; and a computer readable medium in communication with the processor, the computer readable medium storing instructions which, when executed by the processor, cause the processor to: store information relating to an active hot spot, the information identifying a region; relating to the hot spot and information identifying an attraction distance to the sensitive point; receiving, from a requesting device of the plurality of requesting devices, a request to send a vehicle resource to a requested position; automatically identifying that the requested position is outside the region identified as relating to the hot spot; for each vehicle resource of the plurality of vehicle resources capable of meeting the demand, calculating a vehicle resource adequacy score to satisfy the demand, calculating a score comprising: calculating sub-scores for each of a plurality of factors and performing a mathematical operation on the sub-scores, for each vehicle resource that is capable of satisfying the demand, determining whether or not the vehicle resource is within the distance of the sensing point, and for each vehicle resource determined to be within the sensing point's attraction distance, calculating a hit point penalty score and the inclusion of score of 3033066 - 75 - hot spot attraction penalty in the mathematical operation to produce a score for the vehicle resource; and using the calculated scores for the plurality of vehicle resources to select a vehicle resource from the plurality of vehicle resources to be allocated on demand; and allocating the selected vehicle resource on demand.
[0022]
A network vehicle resource allocation system having controlled positions, the system comprising: a plurality of requesting devices; a plurality of vehicle resources, each vehicle resource having a respective controlled present position; and a vehicle resource allocation controller device comprising: a processor in communication with the plurality of requesting devices and the plurality of vehicle resources, and a computer readable medium in communication with the processor of the allocation controller device of vehicle resources, the computer-readable medium storing instructions which, when executed by the processor, cause the processor to store information relating to a hot spot, the information comprising position information identifying a position relative to the hot spot ; automatically identifying that a position relating to a request of a calling device of the plurality of calling party devices satisfies a requirement of relationship to the position of the hot spot respectively; identifying a plurality of vehicles, of the plurality of vehicle resources, that are capable of satisfying the demand; calculating a hotspot attraction score for a first subset of the plurality of vehicles; Not calculating a hotspot attraction score for a second subset of the plurality of vehicles, the first subset not intersecting the second subset; using the hot spot attraction scores to calculate scores for the vehicles of the first subset with respect to demand; calculating scores for the vehicles of the second subset of vehicles with respect to demand; use the scores calculated for the several vehicles to select a vehicle to be allocated on demand; and allocate the selected vehicle on demand.
[0023]
The system of claim 22, wherein calculating a hotspot attraction score for the first subset of the plurality of vehicles comprises: receiving an indication of the current controlled position of each vehicle of the first vehicle; subset.
[0024]
24. The system of claim 23, wherein receiving the present controlled position indication of the vehicle comprises: receiving the indication of the current controlled position from the vehicle.
[0025]
25. The system of claim 23, wherein receiving the indication of the current controlled position of the vehicle comprises: receiving the indication of the current controlled position from a positioning service in communication with the vehicle.
[0026]
The system of any one of claims 22 to 25, wherein the request includes a first responder request. 30
[0027]
27. System according to any one of claims 22 to 25, wherein the request comprises a customer reservation of a rental vehicle with driver. 3033066 - 77 -
[0028]
The system of any one of claims 22 to 25, wherein the position relating to the request comprises a deposition position or a collection position. 5
[0029]
The system of any one of claims 22 to 25, wherein the request includes a request to send a vehicle to a search position.
[0030]
The system of any one of claims 22 to 29, wherein the hot spot information includes a sensitive point attracting distance, and wherein calculating a hot spot attraction score for the hot spot. first subset of the plurality of vehicles includes using the skew point pulling distance and a demand associated position to calculate the skew point pull score. 15
[0031]
The system of claim 30, the computer-readable medium further storing instructions which, at their execution by the processor, cause the processor to provide a user interface enabling a user to specify the hotspot attraction distance. 20
[0032]
The system of any one of claims 22 to 31, wherein the non-computation of a hotspot attraction score for the second subset of the plurality of vehicles includes providing an attraction score of no sensible point. 25
[0033]
The system of any one of claims 22 to 32, wherein the hot spot information includes one or more types of vehicles and wherein the first subset of vehicles includes only vehicles associated with a vehicle type. which is a type of vehicle included in the hot spot information. 3033066 - 78 -
[0034]
The system of any one of claims 22 to 33, wherein the hot spot information includes information defining a region to which the vehicles are attracted. 5
[0035]
The system of any one of claims 22 to 34, wherein the region is defined by a postal code region or an administrative district.
[0036]
36. The system of any one of claims 22 to 35, wherein the computer-readable medium further stores instructions that, when executed by the processor, cause the processor to: use a destination of a second request that is presently satisfied by a vehicle in calculating the vehicle score for the request.
[0037]
37. A method for allocating resources of networked vehicles having controlled positions, the method comprising: storing, by a vehicle resource allocation controller, information relating to a hotspot, the information including position information identifying a position relative to the hot spot, wherein the vehicle resource allocation controller device is in communication with: a plurality of caller devices, and a plurality of vehicle resources, each vehicle resource having a respective current controlled position; the automatic identification, by the vehicle resource allocation controller device, that a position relating to a request by a calling device of the plurality of calling party devices satisfies a requirement of respectively relating to the position relating to the point sensitive; identifying, by the vehicle resource allocation controller device, a plurality of vehicles, the plurality of vehicle resources, that are capable of satisfying the demand; Calculating, by the vehicle resource allocation controller device, a skew point attraction score for a first subset of the plurality of vehicles; non-calculating a hotspot attraction score for a second subset of the plurality of vehicles, the first subset not intersecting the second subset; the use by the vehicle resource allocation controller device of the hot spot attraction scores to calculate the scores of the vehicles of the first subset with respect to the demand; Calculating, by the vehicle resource allocation controller, scores for the vehicles of the second subset of vehicles relative to the demand; the use by the vehicle resource allocation controller device of scores calculated for the plurality of vehicles for selecting a vehicle to be allocated on demand; and allocating, by the vehicle resource allocation controller device, the selected vehicle on demand.
[0038]
38. A network vehicle resource allocation apparatus having controlled positions, the apparatus comprising: a processor in communication with: a plurality of requesting devices, and a plurality of vehicle resources, each vehicle resource having a respective current controlled position; and a computer-readable medium in communication with the processor, the computer-readable medium storing instructions which, at their execution by the processor, cause the processor to: store information relating to a hot spot, the information including information about a position identifying a position relative to the hot spot, automatically identifying that a position relating to a request by a calling device of the plurality of calling party devices satisfies a requirement of relationship to the position relative to the hot spot respectively; identifying a plurality of vehicles, the plurality of vehicle resources, that are capable of satisfying demand; calculate a hotspot attraction score for a first subset of the plurality of vehicles; not calculating a hotspot attraction score for a second subset of the plurality of vehicles, the first subset not intersecting the second subset; use the hot spot attraction scores to calculate the vehicle scores of the first subset with respect to demand; calculating scores for the vehicles of the second subset of vehicles with respect to demand; Using the scores calculated for the several vehicles to select a vehicle to be allocated on demand; and allocate the selected vehicle on demand.
[0039]
39. A network vehicle resource allocation system having controlled positions, the system comprising: a plurality of requesting devices a plurality of vehicle resources, each vehicle resource having a respective controlled present position; and a vehicle resource allocation controller device comprising: a processor in communication with the plurality of requesting devices and the plurality of vehicle resources, and a computer readable medium in communication with the processor of the allocation controller device of vehicle resources, the computer-readable medium storing instructions which, when executed by the processor, cause the processor to: store information relating to a hot spot, the information identifying a position relative to the hot spot and 3033066 81 - information identifying one or more types of vehicles, the one or more types of vehicles indicating the types of vehicles to attract to the hotspot, automatically identifying a request for a requesting device from the plurality of requesting devices has a requested position which is at the position relative to the point sensitive or near this one; identifying a plurality of vehicles, of the plurality of vehicle resources, that are capable of satisfying the demand; Calculating a hotspot attraction score for a first subset of the plurality of vehicles, the first subset of the plurality of vehicles comprising only vehicles associated with a vehicle type that corresponds to a type of vehicle included in the information sensitive point; Not calculating a hotspot attraction score for a second subset of the plurality of vehicles, the first subset not intersecting the second subset; using the hot spot attraction scores to calculate the vehicle scores of the first subset with respect to the demand; calculating scores for the vehicles of the second subset of vehicles with respect to demand; use the scores calculated for the several vehicles to select a vehicle to be allocated on demand; and allocate the selected vehicle on demand.
[0040]
The system of claim 39, wherein calculating a hotspot attraction score for the first subset of the plurality of vehicles comprises: receiving an indication of the current controlled position of each vehicle of the first vehicle; subset. 3033066 - 82 -
[0041]
The system of claim 40, wherein receiving the indication of the current controlled position of the vehicle comprises: receiving the indication of the current controlled position from the vehicle. 5
[0042]
42. The system of claim 40, wherein receiving the indication of the current controlled position of the vehicle comprises: receiving the indication of the current controlled position from a positioning service in communication with the vehicle. 10
[0043]
43. The system of any one of claims 39 to 42, wherein the request includes a request for a first responder's vehicle.
[0044]
44. The system of any one of claims 39 to 42, wherein the request includes a customer reservation of a rental vehicle with driver. 15
[0045]
45. The system of any one of claims 39 to 42, wherein the requested position of the request comprises a deposition position or a collection position. 20
[0046]
The system of any one of claims 39 to 42, wherein the request includes a request to send a vehicle to a search position.
[0047]
47. The system of any one of claims 39 to 46, wherein the hot spot information includes information identifying an attraction distance to the sensing point; and wherein the automatic identification that a request has a requested position that is at or near the location of the hot spot includes identifying that the request has a requested position within the distance of attraction of the sore spot. 3033066 - 83 -
[0048]
48. The system of claim 47, wherein the computer-readable medium further stores instructions that, when executed by the processor, cause the processor to provide a user interface for a user to specify pull-distance information. to the sensitive point.
[0049]
49. A system according to claim 47 or claim 48, the computer readable medium further storing instructions which, when executed by the processor, cause the processor to identify that a request has a requested position which is at the position of the sensitive point or near it by calculating a direct distance between the vehicle and the hotspot and comparing the calculated distance to the attraction distance.
[0050]
50. The system of any one of claims 47 to 49, wherein the calculation of the hotspot attraction score comprises using the hotspot attraction distance in computing the attraction penalty score. of sensitive point.
[0051]
51. A system according to any one of claims 39 to 50, the computer readable medium further storing instructions which, at their execution by the processor, cause the processor to: provide a user interface enabling a user to define a sensitive point, the user interface allowing the user to specify the position relative to the hot spot. 25
[0052]
The system of claim 51, the computer-readable medium further storing instructions which, at their execution by the processor, cause the processor to: provide the user interface for a user to specify a start time and / or an hour of end of activity of the sensitive point. 3033066 - 84 -
[0053]
53. A system according to claim 51 or claim 52, the computer readable medium further storing instructions which, at their execution by the processor, cause the processor to: provide the user interface for a user to specify information periodicity of activity of the sensitive point.
[0054]
The system of any one of claims 39 to 53, wherein the calculation of the hotspot attraction score comprises calculating a distance between the requested position of the request and the position relative to the hotspot, the performing a mathematical operation on the calculated distance and the attraction distance, and using the result of the mathematical operation in the calculation of the hotspot attraction penalty score.
[0055]
A system according to any one of claims 39 to 54, wherein the calculation of the hotspot attraction score comprises calculating a distance between the requested position of the request and the position relating to the hotspot, the subtraction of the computed distance of the attraction distance, and the use of the result of the subtraction in the calculation of the penalty point attraction score. 20
[0056]
The system of any one of claims 39 to 55, wherein the calculation of the hotspot attraction score comprises calculating a distance between the requested position of the request and the position relating to the hotspot and the use of the calculated distance in the calculation of the penalty point attraction score. 25
[0057]
57. System according to any one of claims 39 to 56, wherein the calculation of the hotspot attraction score comprises the multiplication of a value by a parametric bonus value, the bonus parameter value being part of the information relating to at the sensitive point. 30
[0058]
58. System according to any one of claims 39 to 57, the computer-readable medium furthermore memorizing instructions which, when executed by the processor, cause the processor to: calculate a direct distance between the requested position of the request and the position of the hot spot using latitude and longitude information of the requested position of the reservation and the position relative to the hot spot. 5
[0059]
59. The system of any one of claims 39 to 58, wherein the position relative to the hotspot is defined with reference to a center of a region of the hotspot.
[0060]
A method of allocating resources of networked vehicles having controlled positions, the method comprising: storing, by a vehicle resource allocation controller, information relating to a hot spot, the information identifying a position relating to the hot spot and information identifying one or more types of vehicles, the one or more types of vehicles each indicating the types of vehicles to be attracted to the hot spot, wherein the resource allocation controller device vehicles is in communication with: a plurality of requesting devices, and a plurality of vehicle resources, each vehicle resource having a respective controlled present position; the automatic identification, by the vehicle resource allocation controller device, that a request from a calling device of the plurality of calling party devices has a requested position which is at the position relating to the hot spot or near of it; The identification, by the vehicle resource allocation controller device, of a plurality of vehicles, of the plurality of vehicle resources, which are capable of satisfying the demand; the calculation by the vehicle resource allocation controller device of a hotspot attraction score for a first subset of the plurality of vehicles, wherein the first subset of the plurality of vehicles includes only the vehicles associated with a vehicle type that corresponds to a type of vehicle included in the sifting point information; The non-computation of a hotspot attraction score for a second subset of the plurality of vehicles, the first subset not intersecting the second subset; the use by the vehicle resource allocation controller device of the hot spot attraction scores to calculate scores for the vehicles of the first subset with respect to the demand; calculating, by the vehicle resource allocation controller device, scores for vehicles of the second subset of vehicles with respect to demand; The use by the vehicle resource allocation controller device of scores calculated for the plurality of vehicles for selecting a vehicle to be allocated on demand; and allocating, by the vehicle resource allocation controller device, the selected vehicle on demand. 15
[0061]
61. A network vehicle resource allocation apparatus having controlled positions, the apparatus comprising: a processor in communication with: a plurality of requesting devices, and a plurality of vehicle resources, each vehicle resource having a respective current controlled position; and a computer-readable medium in communication with the processor, the computer-readable medium storing instructions which, when executed by the processor, cause the processor to store information relating to a hot spot, the information identifying a relative position at the sensitive point and information identifying one or more types of vehicles, the one or more types of vehicles each indicating the types of vehicles that must be attracted to the hotspot; Automatically identifying that a request from a calling party of the plurality of calling party devices has a requested position which is at the position relative to or near the hot spot; Identifying a plurality of vehicles, of the plurality of vehicle resources, that are capable of satisfying demand; calculating a hotspot attraction score for a first subset of the plurality of vehicles, wherein the first subset of the plurality of vehicles includes only those vehicles associated with a vehicle type that corresponds to a vehicle type included in the information on the hot spot; not calculating a hotspot attraction score for a second subset of the plurality of vehicles, the first subset not intersecting the second subset; using the hot spot attraction scores to calculate scores for the vehicles of the first subset with respect to demand; calculating scores for the vehicles of the second subset of vehicles with respect to demand; Using the scores calculated for the several vehicles to select a vehicle to be allocated on demand; and allocate the selected vehicle on demand.

类似技术:

---

公开号 | 公开日 | 专利标题

---

FR3033066A1|2016-08-26|

---

FR3033439A1|2016-09-09|RESOURCE MANAGEMENT

---

US10671961B2|2020-06-02|Systems and methods for transportation

---

US20190318630A1|2019-10-17|Preemptively navigating drivers to an event location to transport passengers upon completion of the event

---

US10467561B2|2019-11-05|System for identifying events and preemptively navigating drivers to transport passengers from the events

---

US20160364679A1|2016-12-15|Systems and methods for on-demand transportation

---

US20160364823A1|2016-12-15|Systems and methods for on-demand transportation

---

US20160364812A1|2016-12-15|Systems and methods for on-demand transportation

---

US20170169366A1|2017-06-15|Systems and Methods for Adjusting Ride-Sharing Schedules and Routes

---

US20150254581A1|2015-09-10|Rideshare system and method to facilitate instant carpooling

---

US10817969B2|2020-10-27|Transmitting navigation instructions to a driver device to direct the driver device to a geographic region in view of locations and device activity of user devices

---

US20210209542A1|2021-07-08|System for selecting drivers for transportation requests with specified time durations

---

US20180293687A1|2018-10-11|Ridesharing management for autonomous vehicles

---

WO2016135646A1|2016-09-01|Telephone call placement

---

US20210133908A1|2021-05-06|Integrated social networking mobile application with ride sharing program

---

US20180315088A1|2018-11-01|Recommendation engine for generating context-specific recommendations

---

US20200065718A1|2020-02-27|Dynamic ad-hoc availability and physical reservation system using market analytics, social metadata, and cognitive analytics

---

WO2005093685A1|2005-10-06|Method and system for passenger transport

---

US20170193626A1|2017-07-06|System for navigating transportation service providers to fulfill transportation requests authorized by an organization

---

WO2019086796A1|2019-05-09|Method for making available a vehicle and its return in a fleet of vehicles available for reservation, reservation method of a vehicle, system

---

US20200355510A1|2020-11-12|Method and system for multi-modal transportation

---

FR3095068A1|2020-10-16|APPARATUS AND METHOD OF ASSISTANCE TO A USER FOR THE RESERVATION OF A TRIP

---

CN111353090A|2020-06-30|Service distribution method, device, server and readable storage medium

同族专利:

---

公开号 | 公开日

---

US9805431B2|2017-10-31|

---

WO2016135645A1|2016-09-01|

---

EP3262599A1|2018-01-03|

---

US11062415B2|2021-07-13|

---

US20160247247A1|2016-08-25|

---

US20180060992A1|2018-03-01|

---

GB201503083D0|2015-04-08|

---

EP3262599A4|2018-08-01|

引用文献:

---

公开号 | 申请日 | 公开日 | 申请人 | 专利标题

---

US20120239452A1|2011-03-17|2012-09-20|Aarjav Trivedi|Fleet Management Systems and Processes|

---

US7113864B2|1995-10-27|2006-09-26|Total Technology, Inc.|Fully automated vehicle dispatching, monitoring and billing|

---

US20020034292A1|2000-08-22|2002-03-21|Tuoriniemi Veijo M.|System and a method to match demand and supply based on geographical location derived from a positioning system|

---

GB2372845A|2000-11-04|2002-09-04|Freephone Taxis Ltd|Travel planning, booking and payment over a remote network|

---

JP2003109191A|2001-09-28|2003-04-11|Fujitsu Ltd|Vehicle allocation system and vehicle allocation processor|

---

US6931308B2|2001-10-12|2005-08-16|Lewis C. Read|Viable alternative to private vehicles in urban areas|

---

US7363234B2|2002-02-01|2008-04-22|Canadian National Railway Company|System and method for providing a price quotation for a transportation service based on equipment ownership|

---

US8108231B2|2002-06-14|2012-01-31|The Crawford Group, Inc.|Method and apparatus for improved customer direct on-line reservation of rental vehicles|

---

WO2004013733A2|2002-08-02|2004-02-12|Limoq, Inc.|Method, system and apparatus for providing transportation services|

---

JP2004157698A|2002-11-06|2004-06-03|Nec Corp|Taxi service system, mobile terminal and taxi service method and program used for them|

---

KR20030096144A|2002-11-21|2003-12-24|모비츠|Driving management method for vehicles, and a mobile terminal and a driving management server for the same|

---

EP1455291A1|2003-03-06|2004-09-08|Comptel OYJ|Method, means and computer program product for setting rating|

---

JP3730967B2|2003-03-20|2006-01-05|株式会社エヌ・ティ・ティ・ドコモ|Vehicle allocation system and management server|

---

US6925381B2|2003-06-24|2005-08-02|Bellsouth Intellectual Property Corporation|Methods, systems and computer program products for ride matching based on current location information|

---

US8599832B2|2005-09-28|2013-12-03|Ingenio Llc|Methods and apparatuses to connect people for real time communications via voice over internet protocol |

---

JP2007334472A|2006-06-13|2007-12-27|Mitsubishi Electric Engineering Co Ltd|Taxi fare system device|

---

US20080059252A1|2006-08-29|2008-03-06|Timothy Boyer|System and Method for the Allocation of High Demand Properties|

---

GB2442277B|2006-09-29|2011-05-11|Avaya Ecs Ltd|Dynamic configuration of VoIP trunks|

---

US20080114629A1|2006-11-09|2008-05-15|Yahoo! Inc.|System for matching users and transportation providers|

---

US8566028B2|2006-11-27|2013-10-22|International Business Machines Corporation|Apparatus, system, and method for autonomously determining a set of destinations|

---

US20080189145A1|2007-02-02|2008-08-07|Mach 9 Travel, Llc|System and Method of Determining Rental Resource Availability for Transportation Services|

---

CN101652789A|2007-02-12|2010-02-17|肖恩·奥沙利文|Share transportation system and service network|

---

US9285228B2|2007-06-14|2016-03-15|Panasonic Automotive Systems Company Of America, Division Of Panasonic Corporation Of North America|Location based point of interest navigation system|

---

US20090172009A1|2007-12-28|2009-07-02|Carpools Consolidated Corporation|Carpool or Ride Matching by wireless digital messaging Linked Database|

---

US8306921B2|2008-02-13|2012-11-06|Toyota Motor Engineering & Manufacturing North America, Inc.|Mobile recommendation and reservation system|

---

US20090313077A1|2008-06-17|2009-12-17|Wheeler Iv George Y|Consumer initiated, service provider direct dispatching system|

---

US9519921B2|2008-06-27|2016-12-13|E-Lantis Corporation|GPS and wireless integrated fleet management system and method|

---

US8626565B2|2008-06-30|2014-01-07|Autonomous Solutions, Inc.|Vehicle dispatching method and system|

---

JP5329193B2|2008-12-08|2013-10-30|矢崎エナジーシステム株式会社|Vehicle fare notification device|

---

TWI433527B|2009-09-11|2014-04-01|Shih Pi Ta Technology Ltd|Building a communication link method and system thereof|

---

US10134045B2|2009-09-14|2018-11-20|Ipaj, Llc|Awarding message slots for a consumer mobile device campaign|

---

US10002198B2|2009-10-28|2018-06-19|Verizon Patent And Licensing Inc.|Mobile taxi dispatch system|

---

CA2782611C|2009-12-04|2018-07-10|Uber Technologies, Inc.|System and method for arranging transport amongst parties through use of mobile devices|

---

US8612273B2|2010-04-01|2013-12-17|The Crawford Group, Inc.|Method and system for managing vehicle travel|

---

KR101165805B1|2010-07-01|2012-07-13|아트아크앤도어웍스|Method for providing a service to call a driver of a vehicle with a smart phone|

---

WO2012009479A1|2010-07-13|2012-01-19|Telenav, Inc.|Navigation system with ecological route based destination guidance mechanism and method of operation thereof|

---

US20120041675A1|2010-08-10|2012-02-16|Steven Juliver|Method and System for Coordinating Transportation Service|

---

US8442848B2|2011-03-09|2013-05-14|David Myr|Automatic optimal taxicab mobile location based dispatching system|

---

JP2012190237A|2011-03-10|2012-10-04|Osaka Gas Co Ltd|Arrangement method determination system for vehicle|

---

US20140149153A1|2011-07-01|2014-05-29|Christos G. Cassandras|Method and system for dynamic parking allocation in urban settings|

---

US10121129B2|2011-07-05|2018-11-06|Visa International Service Association|Electronic wallet checkout platform apparatuses, methods and systems|

---

US20130031001A1|2011-07-26|2013-01-31|Stephen Patrick Frechette|Method and System for the Location-Based Discovery and Validated Payment of a Service Provider|

---

US20140340241A1|2011-09-14|2014-11-20|Smart Ship Holdings Limited|Allocating an area to a vehicle|

---

KR20130082567A|2011-12-09|2013-07-22|한국비에이|Method and system of managing call for taxi|

---

JP6143214B2|2011-12-27|2017-06-07|株式会社Ｉｎｔｅｌａｄｅ|Taxi vehicle calling system using portable terminals|

---

AU2012203006A1|2012-02-21|2013-09-05|Car Pilots Pty Ltd|Systems and methods for booking transport|

---

US9305310B2|2012-03-19|2016-04-05|Uber Technologies, Inc.|Enabling a user to verify a price change for an on-demand service|

---

US20130282602A1|2012-04-18|2013-10-24|Yingjie Wang|TaxiZag|

---

US20130297463A1|2012-05-07|2013-11-07|U.S.A. Vendicab Corp.|Inventory management system for mobile vending machines|

---

WO2013188097A2|2012-06-15|2013-12-19|Telogis, Inc.|Vehicle fleet routing system|

---

JP5935887B2|2012-07-02|2016-06-15|トヨタ自動車株式会社|On-demand vehicle operation management device, on-demand vehicle operation management method, and on-demand vehicle operation management system|

---

US10055694B2|2012-08-07|2018-08-21|Hitachi, Ltd.|Use-assisting tool for autonomous mobile device, operation management center, operation system, and autonomous mobile device|

---

CA2881481A1|2012-08-07|2014-02-13|Sa'ad ABUODEH|System for automatically matching a service requestor with a service provider based on their proximity and establishing a voice call between them|

---

US20140052645A1|2012-08-17|2014-02-20|Apple Inc.|Multi-channel customer support and service|

---

CN102831769B|2012-08-29|2014-09-03|申屠祖军|Caller and taxi matching method for taxi service system|

---

US20140067195A1|2012-08-30|2014-03-06|Frias Transportation Infrastructure Llc|On board diagnostic device system and method|

---

US9230292B2|2012-11-08|2016-01-05|Uber Technologies, Inc.|Providing on-demand services through use of portable computing devices|

---

EP2747000B1|2012-12-20|2017-11-22|ABB Schweiz AG|System and method for automatic allocation of mobile resources to tasks|

---

US20140309930A1|2013-04-15|2014-10-16|Flextronics Ap, Llc|Automatic camera image retrieval based on route traffic and conditions|

---

US20150032485A1|2013-07-25|2015-01-29|Mark Nelson|Digital method For Providing Transportation Services|

---

US9530314B2|2013-08-08|2016-12-27|Accenture Global Services Limited|Dynamic ETA and STA transportation system|

---

JP6245563B2|2013-10-04|2017-12-13|三菱重工機械システム株式会社|Car sharing management device, car sharing management method, and program|

---

CN105917376A|2013-12-11|2016-08-31|优步技术公司|Optimizing selection of drivers for transport requests|

---

WO2015089221A1|2013-12-11|2015-06-18|Uber Technologies, Inc.|Intelligent queuing for user selection in providing on-demand services|

---

WO2015099679A1|2013-12-23|2015-07-02|Intel Corporation|In-vehicle authorization for autonomous vehicles|

---

US9984574B2|2014-01-21|2018-05-29|Tribal Rides, Inc.|Method and system for anticipatory deployment of autonomously controlled vehicles|

---

ES2525738B2|2014-01-27|2015-04-13|Martín HERRÁIZ HERRÁIZ|Procedure for supervision and control of vehicle routes to optimize the use of their load capacities|

---

CA2956063A1|2014-07-22|2016-01-28|Lyft, Inc.|Ride chaining|

---

WO2016019189A1|2014-07-30|2016-02-04|Uber Technologies, Inc.|Arranging a transport service for multiple users|

---

JP6432205B2|2014-08-15|2018-12-05|富士通株式会社|Reservation management method, reservation management program, and reservation management apparatus|

---

US20160132792A1|2014-11-10|2016-05-12|Carzac, Inc.|Systems and methods for facilitating transportation transactions|

---

GB201503083D0|2015-02-24|2015-04-08|Addison Lee Ltd|Allocating vehicles to private hire bookings|

---

GB201503081D0|2015-02-24|2015-04-08|Addison Lee Ltd|A system and method of calculating a price for a vehicle journey|

---

GB2535719B|2015-02-24|2018-06-13|Addison Lee Ltd|Telephone call placement|

---

GB2535718A|2015-02-24|2016-08-31|Addison Lee Ltd|Resource management|

---

US20160364823A1|2015-06-11|2016-12-15|Raymond Cao|Systems and methods for on-demand transportation|

---

US20160364812A1|2015-06-11|2016-12-15|Raymond Cao|Systems and methods for on-demand transportation|

---

US9716565B2|2015-11-12|2017-07-25|Ben Mandeville-Clarke|System, apparatus, and method for generating and transmitting an interruption signal to a substantially autonomous vehicle|

---

US9702714B2|2015-12-03|2017-07-11|International Business Machines Corporation|Routing of vehicle for hire to dynamic pickup location|

---

US20170169366A1|2015-12-14|2017-06-15|Google Inc.|Systems and Methods for Adjusting Ride-Sharing Schedules and Routes|

---

US10395333B2|2016-06-07|2019-08-27|Uber Technologies, Inc.|Hierarchical selection process|

---

US20180005144A1|2016-06-29|2018-01-04|RideSage Inc.|Delaying rides pre-arranged with ridesharing services|

---

US10607192B2|2016-08-25|2020-03-31|Ford Global Technologies, Llc|Methods and apparatus for autonomous vehicle scheduling|

---

US20180143027A1|2016-11-22|2018-05-24|Microsoft Technology Licensing, Llc|Dynamic route planning for demand-based transport|

---

US11132626B2|2016-11-30|2021-09-28|Addison Lee Limited|Systems and methods for vehicle resource management|

---

US10679312B2|2017-04-25|2020-06-09|Lyft Inc.|Dynamic autonomous vehicle servicing and management|GB201503083D0|2015-02-24|2015-04-08|Addison Lee Ltd|Allocating vehicles to private hire bookings|

---

GB2535718A|2015-02-24|2016-08-31|Addison Lee Ltd|Resource management|

---

US9628555B2|2015-06-18|2017-04-18|Live Nation Entertainment, Inc|Enhanced load processing using linked hierarchical data structures|

---

US10692028B2|2015-12-09|2020-06-23|Sap Se|Optimal demand-based allocation|

---

US20170193625A1|2015-12-21|2017-07-06|Lyft, Inc.|Driver supply control|

---

US9953389B2|2015-12-29|2018-04-24|Gt Gettaxi Limited|System for preemptively navigating drivers to passengers based on passenger device activity|

---

US9897457B2|2016-02-10|2018-02-20|International Business Machines Corporation|Method and system for controlling vehicles and drones|

---

US11120375B2|2016-08-26|2021-09-14|Conduent Business Services, Llc|System and method for monitoring parking enforcement officer performance in real time with the aid of a digital computer|

---

US11062241B2|2016-08-26|2021-07-13|Conduent Business Services, Llc|System and method for facilitating parking enforcement officer dispatching in real time with the aid of a digital computer|

---

US11157860B2|2016-08-26|2021-10-26|Conduent Business Services, Llc|System and method for motivating parking enforcement officer performance with the aid of a digital computer|

---

US11126942B2|2016-08-26|2021-09-21|Conduent Business Services, Llc|System and method for facilitating parking enforcement officer performance in real time with the aid of a digital computer|

---

US11151494B2|2016-08-26|2021-10-19|Palo Alto Research Center Incorporated|System and method for visualizing parking enforcement officer movement in real time with the aid of a digital computer|

---

US11144855B2|2016-08-26|2021-10-12|Conduent Business Services, Llc|System and method for managing coverage of parking enforcement for a neighborhood with the aid of a digital computer|

---

US10263971B2|2016-08-31|2019-04-16|Bank Of America Corporation|Preventing unauthorized access to secured information systems by injecting device data collectors|

---

US10412093B2|2016-08-31|2019-09-10|Bank Of America Corporation|Preventing unauthorized access to secured information systems by injecting device data collectors|

---

US10417589B2|2016-11-01|2019-09-17|Uber Technologies, Inc.|Pre-selection of drivers in a passenger transport system|

---

US10559209B2|2016-11-10|2020-02-11|Sap Se|Vehicle position planning|

---

US10234869B2|2016-11-11|2019-03-19|Ford Global Technologies, Llc|Vehicle destinations|

---

US11132626B2|2016-11-30|2021-09-28|Addison Lee Limited|Systems and methods for vehicle resource management|

---

US20180225796A1|2017-02-08|2018-08-09|Uber Technologies, Inc.|Resource Allocation in a Network System|

---

WO2018146622A1|2017-02-08|2018-08-16|Uber Technologies, Inc.|Dynamic selection of geo-based service options in a network system|

---

US20180315146A1|2017-04-27|2018-11-01|Lyft, Inc.|Dynamic autonomous vehicle matching optimization|

---

US10839695B2|2017-05-11|2020-11-17|Uber Technologies, Inc.|Network computer system to position service providers using provisioning level determinations|

---

US10628903B2|2017-05-22|2020-04-21|Uber Technologies, Inc.|Network computer system to implement counter values for arranging services|

---

US20180356817A1|2017-06-07|2018-12-13|Uber Technologies, Inc.|System and Methods to Enable User Control of an Autonomous Vehicle|

---

US10620629B2|2017-06-22|2020-04-14|The Boeing Company|Autonomous swarm for rapid vehicle turnaround|

---

US10732000B2|2017-09-12|2020-08-04|Uber Technologies, Inc.|Promoting user compliance with adaptive checkpoints|

---

US20190154454A1|2017-11-22|2019-05-23|Uber Technologies, Inc.|Dynamic route recommendation and progress monitoring for service providers|

---

US10559211B2|2017-11-27|2020-02-11|Uber Technologies, Inc.|Real-time service provider progress monitoring|

---

US10545510B2|2017-12-12|2020-01-28|Waymo Llc|Fleet management for autonomous vehicles|

---

US10466057B1|2018-07-30|2019-11-05|Wesley Edward Schwie|Self-driving vehicle systems and methods|

---

US20200118444A1|2018-10-16|2020-04-16|Allstate Insurance Company|Roadside assistance program|

---

US11221622B2|2019-03-21|2022-01-11|Drivent Llc|Self-driving vehicle systems and methods|

---

US20200273345A1|2019-02-26|2020-08-27|Aptiv Technologies Limited|Transportation system and method|

---

CN110009131B|2019-02-28|2020-12-25|河海大学|Network appointment vehicle dispatching method considering multi-factor influence|

---

CN109977066B|2019-03-08|2020-12-15|北京交通大学|Emergency delivery all-in-one machine of territory wisdom|

法律状态:
2017-02-17| PLFP| Fee payment|Year of fee payment: 2 |

---

2018-02-23| PLFP| Fee payment|Year of fee payment: 3 |

---

2020-02-19| PLFP| Fee payment|Year of fee payment: 5 |

---

2021-01-08| PLSC| Publication of the preliminary search report|Effective date: 20210108 |

---

2021-02-24| PLFP| Fee payment|Year of fee payment: 6 |

---

2022-02-16| PLFP| Fee payment|Year of fee payment: 7 |

优先权:

---

申请号 | 申请日 | 专利标题

---

GBGB1503083.6A|GB201503083D0|2015-02-24|2015-02-24|Allocating vehicles to private hire bookings|

---